Balancing Sets of Vectors

IEEE Transactions on Information Theory

Volumn 34, Issue 1, 1988, Pages 128-130

  Alon, N ^a   Bergmann, E E ^b   Coppersmith, D ^c   Odlyzko, A M ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b LUCENT TECHNOLOGIES   (United States)

^c IBM RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC - ENCODING; OPTICAL COMMUNICATION;

BALANCING SETS OF VECTORS; DATA SCRAMBLING; SIGNAL SETS CONSTRUCTION;

MATHEMATICAL TECHNIQUES;

EID: 0023824556     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.2610     Document Type: Article

References (14)

1. N. Alon, S. Friedland, and G. Kalai, “Regular subgraphs of almost regular graphs,” J. Comhinutoriul Theoty Ser. B 37, pp. 79-91, 1984.
2. E. E. Bergmann, A. M. Odlyzko, and S. Sangani, “Weight 1/2 block codes for optical communications,” AT&T Tech. J., vol. 65, no. 3, pp. 85–93, 1986.
3. B. S. Bosik, “The spectral density of a coded binary signal,” Bell Syst. Tech. J., vol. 51, pp. 921–932, 1972.
4. H. Enomoto, P. Frankl, N. Ito, and K. Nomura, “Codes with given distances,” Graphs and Combinatorics, vol. 3, pp. 25–38, 1987.
5. P. Frankl and V. Rödl, “Forbidden intersections,” Trans. Amer. Math. Soc., vol. 300, pp. 259–286, 1987.
6. J. N. Franklin and J. R. Pierce, “Spectra and efficiency of binary codes without dc,” I EEE Trans. Commun., vol. COM-20, pp. 1182–1184, 1972.
7. W. Fulton, Algebraic Curves. Benjamin/Cummings, 1969.
8. A. V. Geramita and J. Seberry, Orthogonal Designs, in Lecture Notes in Pure and Applied Mathematics, vol. 45. New York: Marcel Dekker, 1979.
9. D. E. Knuth, “Efficient balanced codes,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 51–53, 1986.
10. G. L. Pierobon, “Codes for zero spectral density at zero frequency,” IEEE Trans. Inform. Theory, vol. IT-30, pp. 435–439, 1984.
11. J. P. M. Schalkwijk, “An algorithm for source coding,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 395–399, 1972.
12. K. A. S. Immink and G. F. M. Beenker, “Binary transmission codes with higher order spectral zeros at zero frequency,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 452–454, May 1987.
13. H. S. Wilf, “A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects,” Advances in Math., vol. 24, pp. 281–291, 1977.
14. P. E. O’Neil, “Hyperplane cuts of an n-cube,” Discrete Math., vol. 1, pp. 193–195, 1971/72.