Abstract
Evaluation of permanents of some (0,1) circulants is known to be of major importance for designers of certain speech scrambling systems. In this paper we give a lower bound for the number of scrambling patterns we deal with by minimizing the permanent function over some matrix polyhedra.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H. Beker and C. Mitchell,Permutations with prescribed displacement, SIAM J. Alg. Disc. Meth.8 (1987), 338–368.
G.P. Egorycev,The solution of the van der Waerden problem for permanents, Dokl. Akad. Nauk SSSR258 (1981), 1041–1044.
D.I. Falikman,A proof of van der Waerden’s conjecture on the permanents of a doubly stochastic matrix, Mat. Zametik29 (1981), 931–938.
T.H. Foregger,On the minimum value of the permanent of a nearly decomposable doubly stochastic matrix, Lin. Alg. Appl.32 (1980), 75–85.
H. Minc,Recurrence formulas for permanents of (0, 1)-circulants, Lin. Alg. Appl.71 (1985), 241–265.
H. Minc,Minimum permanents of doubly stochastic matrices with prescribed zero entries, Lin. Multilin. Alg.15 (1984), 225–243.
H. Minc,Permanents, Encyclopedia of Math. and Its Appl. Vol 6 (1978), Addison-Wesley, Reading, Mass.
B.L. van der Waerden,Aufgabe 45, Jber. Deutch. Verein35 (1926), 117.
Author information
Authors and Affiliations
Additional information
Supported by TGRC-KOSEF.