Dc-Constrained Codes From Hadamard Matrices

IEEE Transactions on Information Theory

Volumn 37, Issue 3, 1991, Pages 801-807

  Barg, Alexander M ^a   Litsyn, Simon N ^b  

^a INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

^b TELECOM PARISTECH   (France)

Author keywords

incomplete exponential sum; Legendre symbol; Running digital sum

Indexed keywords

DATA STORAGE, DIGITAL; DATA STORAGE, MAGNETIC; MATHEMATICAL TECHNIQUES - POLYNOMIALS;

DC-CONSTRAINED CODES; HADAMARD MATRICES; INCOMPLETE EXPONENTIAL SUM; LEGENDRE SYMBOL; RUNNING DIGITAL SUM;

CODES, SYMBOLIC;

EID: 0026151471     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.79949     Document Type: Article

References (26)

1. A. Barg and S. Litsyn, “A construction of balanced error-correcting codes,” in 2nd Int. Workshop on Algebraic and Combin. Coding Theory, Abstracts of papers, Leningrad, U.S.S.R., 1990, pp. 16–19.
2. P. T. Bateman, S. Chowla, and P. Erdos, “Remarks on the size of L(1,x),” Publ. Math. Debrecen, vol. 1, pp. 165–182, 1950.
3. E. E. Bergmann, A. M. Odlyzko, and S. Sangani, “Half weight block codes for optical communication,” AT&T Tech. J., vol. 65, pp. 85–93, 1986.
4. E. R. Berlekamp, Algebraic Coding Theory. New York, McGraw-Hill, 1968.
5. M. Blaum and H. C. A. van Tilborg, “On error-correcting balanced codes,” IEEE Trans. Inform. Theory, vol. 35, no. 5, pp. 1091–1093, Sept. 1989.
6. A. E. Brouwer, J. B. Shearer, N. J. A. Sloane and W. D. Smith, “A new table of constant weight codes,” IEEE Trans. Inform. Theory, vol. 36, no. 6, pp. 1334–1380, Nov. 1990.
7. A. R. Calderbank, M. A. Herro, and V. Telang, “A multilevel approach to the design of dc-free codes,” IEEE Trans. Inform. Theory, vol. 35, no. 3, pp. 579–583, May 1989.
8. T. Cochrane, “On a trigonometric inequality of Vinogradov,” J. Number Theory, vol. 27, no. 1, pp. 9–16, 1987.
9. G. Cohen and S. Litsyn, “DC-constrained error-correcting codes with small running digital sum,” IEEE Trans. Inform. Theory, vol. 37, no. 3, pt. II, pp. 949–955, May 1991.
10. “DC-constrained error-correcting codes with small running sum,” in 2nd Int. Workshop on Algebraic and Combin. Coding Theory, Abstracts of papers, Leningrad, U.S.S.R., 1990, pp. 49–51.
11. R. H. Deng and M. A. Herro, “DC-free coset codes,” IEEE Trans. Inform. Theory, vol. 34, no. 4, pp. 786–792, July 1988.
12. H. C. Ferreira, “Lower bounds on the minimum Hamming distance achievable with runlength constrained or dc-free block codes and the synthesis of a [16,8]dmin = 4 dc-free block code,” IEEE Trans. Magn., vol. MAG-20, pp. 881–883, Sept. 1984.
13. A. Hildebrandt, “Large values of character sums,” J. Number Theory, vol. 29, no. 3, pp. 271–296, 1988.
14. K. Ireland and M. Rosen, a Classical Introduction to Modern Number Theory. Berlin: Springer, 1982.
15. J. Justesen, “Information rates and power spectra of digital codes,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 457–472, 1982.
16. V. Kolesnik and V. Krachkovsky, “Generating functions and lower bounds on rates of limited error-correcting codes,” IEEE Trans. Inform. Theory, vol. 37, no. 3, pt. II, pp. 778–788, May 1991.
17. V. I. Levenstein, “Bounds for packings of metric spaces and certain applications,” in Prob. Kybemetiki (Prob. Cybern.), vol. 40, pp. 47–110, 1983, in Russian.
18. R. Lid1 and H. Niederreiter, Finite Fields. London: Addison-Wesley, 1983.
19. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam: North Holland, 1977.
20. H. L. Montgomery and R. C. Vaughan, “Exponential sums with multiplicative characters,” Invent. Math., vol. 43, pp. 69–82, 1977.
21. G. Pierobon, “Codes for zero spectral density at zero frequency,” IEEE Trans. Inform. Theory, vol. IT-30, no. 2, pt. II, pp. 435–439, Mar. 1984.
22. W. M. Schmidt, Equations over Finite Fields: An Elementary Approach, Lecture Notes Mathematics, vol. 536. Berlin: Springer, 1976.
23. F. Spitzer, Principles of Random Walk. Princeton, N.J.: Van Nostrand, 1964.
24. A. Tietäväinen, “Lower bounds for the maximum moduli of certain character sums,” J. Lon. Math. Soc., vol. 29, pp. 204–210, 1984.
25. Incomplete Sums and Two Applications of Deligne's Result, in Lecture Notes Mathematics, vol. 1352, L. L. Avramoc and K. B. Tchakerian, Eds. Berlin: Springer, 1988, pp. 190–205.
26. V. A. Zinoviev, “Generalized concatenated codes,” Probl. Per-adach. Inform., vol. 12, no. 1, pp. 5–15, Jan./Mar. 1976. (Probl. Inform. Trans., vol. 12, no. 1, 1976.)