[CITATION][C] Generation of optimal codes by a'pyramid-packing'argument (Corresp.)
J Ziv - IEEE Transactions on Information Theory, 1964 - ieeexplore.ieee.org
The idea behind the search procedure is roughly this: reciprocal polynomials generate
equally good pseudocyclic codes; interchanging g (')(z) and g@)(z) reciprocates g (z).
Hence the search procedure effectively optimizes half of the bits of g (z) when the other half
are given, and then uses this new half as the fixed half. Apparently this requires around 1~
2r'~ steps rather than the 2r which would be needed for an exhaustive search. A 709/7090-
Fortran program for 0 5 1'-2b 5 1 was written and carried out on an IBM 7090. For example …
equally good pseudocyclic codes; interchanging g (')(z) and g@)(z) reciprocates g (z).
Hence the search procedure effectively optimizes half of the bits of g (z) when the other half
are given, and then uses this new half as the fixed half. Apparently this requires around 1~
2r'~ steps rather than the 2r which would be needed for an exhaustive search. A 709/7090-
Fortran program for 0 5 1'-2b 5 1 was written and carried out on an IBM 7090. For example …
Showing the best result for this search. See all results
