Home / Publications / Coding

[a_codes graphic]

Berlekamp, E.R., 2002, "The Performance of Block Codes", Notices of the AMS, January 2002, 17-22.

Berlekamp, E. R., R. Hill, and J. Karim, 1998, "The solution of a problem of Ulam on searching with lies" Proceedings of the IEEE International Symposium on Information Theory, August 16-21, 1998. pages 244-247. Digital Object Identifier 10.1109/ISIT.1998.708849

Berlekamp, E.R., 1996, "Bounded Distance+1 Soft-Decision Reed-Solomon Decoding", IEEE Trans. Inform. Theory, IT 42: 704-720. Corrected version

Berlekamp, E.R., G. Seroussi, and P. Tong, 1994, "A Hypersystolic Reed-Solomon Decoder", Reed-Solomon Codes and Their Applications, S.B. Wicker and V.K. Bhargava (eds.), New York: IEEE Press

Berlekamp, E. R ., and P . T . Liu, 1989, "Elongated Burst Correction With Reed-Solomon Codes", Proceedings of the International Conference on Communication Technology, Beijing, China, July 1989.

Berlekamp, E.R., Peile, R.E., Pope, S.P., 1987, "The Application of Error Control To Communications", IEEE Communications Magazine, Vol. 25, No. 4

Berlekamp, E.R., 1986, "Variable Depth Helical Interleavers", Cyclotomics technical report to NSF.

Berlekamp, E.R., R.J.Currie, R.J. McEliece, C.K. Rushforth, and P. Tong, 1986, "An Error-Control Code With An Imbalance Of Ones And Zeros To Provide A Residual Carrier Component", IEEE MILCOM Conference, October 5, 1986.

Berlekamp, E.R., William E. Toms, and Jerry Shifman, 1986, "An Application Of Reed-Solomon Codes To A Satellite TDMA System", IEEE MILCOM Conference.

Berlekamp, E.R., 1983, "The Construction Of Fast High-Rate Soft-Decision Block Decoders", IEEE Trans. Inform. Theory, IT 29: 372-377.

Berlekamp, E.R., 1982, "Bit-Serial Reed-Solomon Encoders", IEEE Trans. Inform. Theory, IT 28:869-874.

Berlekamp, E.R., and McEliece, Robert J., l982, "Average Case Optimized Buffered Decoders", Cyclotomics, Inc., Berkeley, CA.

Berlekamp, E.R., 1982, "Error-Correcting Codes For Digital Audio", Collected Papers From The Audio Engineering Society Premiere Conference.

Berlekamp, E.R., 1980, "The Technology Of Error-Correcting Codes", Proc.of the IEEE, 68: 564-593 .

Berlekamp, E.R., and J.L. Ramsey, 1978, "Readable Erasures Improve The Performance Of Reed-Solomon Codes (Corresp.)", IEEE Trans. Inform. Theory, IT 24:632-633.

Berlekamp, E.R., R.J. McEliece, and H.C.A. Van Tilborg, 1978, "On The Inherent Intractability Of Certain Coding Problems", IEEE Trans. Inform. Theory, IT 24:384-386.

Berlekamp, E.R., 1977, "Long Block Codes Which Use Soft Decisions And Correct Erasure Bursts Without Interleaving", pp. 1-2 in Proc. of the National Telecommunications Conference, Los Angeles.

Berlekamp, E.R., 1975, "Algebraic Codes For Improving The Reliability Of Tape Storage", pp.497-499 in Proceedings of the AFIPS Conference.

Berlekamp, E.R., and J. Justesen, 1974, "Some Long Cyclic Linear Binary Codes Are Not So Bad", IEEE Trans. Inform. Theory, IT 20:351-356.

Berlekamp, E.R., and 0. Moreno, 1973, "Extended Double-Error Correcting Binary Goppa Codes Are Cyclic", IEEE Trans. Inform. Theory, IT 19:817-818.

Berlekamp, E.R., 1973, "Goppa Codes", IEEE Trans. Inform. Theory, IT 19:590-592.

Berlekamp, E.R., 1973, "The Golay-Viterbi Concatenation Scheme", JPL Technical Report 32-1526, Vol. 16.

Kerdock, A.M., ghost written and communicated by Berlekamp, E.R., 1972, "A Class Of Low-Rate Nonlinear Binary Codes", Information and Control, Vol. 20, No. 2.

Berlekamp, E.R., 1972, "A Survey Of Coding Theory", J. Royal Stat. Soc. Series A, 135:44-73.

Berlekamp, E.R., 1972, "Long Primitive Binary BCH Codes Have Distance d-2n ln R^-l/log n...", IEEE Trans. Inform. Theory, IT 18:415-426.

Berlekamp, E.R., F.J. MacWilliams, and N.J.A. Sloane, 1972, "Gleason's Theorem On Self-Dual Codes", IEEE Trans Inform. Theory, IT 18:409-414.

Berlekamp, E.R., and L.R. Welch, 1972, "Weight Distributions Of the Cosets Of The (32,6) Reed-Muller Code", IEEE Trans. Inform. Theory, IT 18:203-207.

Berlekamp, E.R., 1971, "Coding Theory And The Mathieu Groups", Inform. Control, 18:40-64.

Berlekamp, E.R., and N.J.A. Sloane, 1970 "Weight Enumerator For Second-Order Reed-Muller Codes", IEEE Transactions on Information Theory, Vol. IT-16, No. 6.

Berlekamp, E.R., 1970, "The Weight Enumerators For Certain Subcodes Of The Second Order Binary Reed-Muller Codes", Inform. Control, 17:485-500

Berlekamp, E.R., 1970, "Doubly Extended RS Codes Are Cyclic After Prenormalization". Tech. Memo, Bell Telephone Laboratories

Berlekamp, E.R., and N.J.A. Sloane, 1969, "Restrictions On Weight Distribution and Reed-Muller Codes", Inform. Control, 14:442-456; Math. Rev., 39:5215

Berlekamp, E.R., 1969, "A Survey Of Coding Theory", pp. 3-11 in Proceedings of the Waterloo Conference on Combinatorial Mathematics, RECENT PROGRESS IN COMBINATORICS, Academic Press, Inc., New York.

Berlekamp, E.R., 1969, "Techniques For Computing Weight Enumerators", Tech Memo, Bell Telephone Laboratories

Berlekamp, E.R., 1969, "On The Carlitz-Uchiyama Bound", Tech. Memo, Bell Telephone Laboratories.

Berlekamp, E.R., 1968, "Nonbinary BCH Decoding", IEEE Trans. Inform.Theory, IT 14:242.

Berlekamp, E.R., 1968, "Block Coding For The Binary Symmetric Channel With Noiseless, Delayless Feedback", pp. 61-88 in H.B. Mann (ed.), ERROR-CORRECTING CODES, Wiley & Sons, New York.

Berlekamp, E.R., 1968, "Weight Enumeration Theorems", pp. 161-170 in Proc. 6th Annual Allerton Conf. Circuit and Systems Theory, Univ. Illinois Press, Urbana, Illinois.

Berlekamp, E.R., 1967, "Negacyclic Codes For The Lee Metric", in COMBINATORIAL MATHEMATICS AND ITS APPLICATIONS, R.C. Bose, and T.A. Dowling (eds.), University of North Carolina Press, Chapel Hill, North Carolina.

Golomb, S.W., Berlekamp, E.R., Cover, T.M., Gallager, R.G., Massey, J.L., and Viterbi, A.J., 2002 "Claude Elwood Shannon (1916-2001)", Notices of the AMS, January 2002, 8-16.

Jacobs I.M. and E.R. Berlekamp 1967, "A Lower Bound To The Distribution Of Computation For Sequential Decoding", IEEE Transactions on Information Theory, Vol. IT-13, No. 2, pp 167-174.

Shannon, C.E., R.G.Gallager, and E.R. Berlekamp, 1967, "Lower Bounds To Error Probability For Coding On Discrete Memoryless Channels II", Inform. Control, 10:522-552.

Shannon, C.E., R.G.Gallager, and E.R. Berlekamp, 1967, "Lower Bounds To Error Probability For Coding On Discrete Memoryless Channels I", Inform. Control, 10: 65-103.

Berlekamp, E.R., 1967, "The Enumeration of Information Symbols in BCH Codes", Bell System Tech. J., 46:1861-1880.

Berlekamp, E.R., l966, "Two Identical Binary Erasure Channels With Feedback Are Exponentially Better Than One Channel At Low Rates", JPL SPS 37-37, Vo. IV, Section 31.

Berlekamp, E.R., 1965, "On Decoding Bose-Chaudhuri-Hocquenghem Codes", IEEE Trans. Inform. Theory, IT 11: 577-579.

Berlekamp, E.R., 1964, "Note On Recurrent Codes", IEEE Trans. Inform. Theory, IT 10: 257-258.

Berlekamp, E. R., 1964, "Block Coding with Noiseless Feedback", thesis

Berlekamp, E.R., 1963, "A Class of Convolutional Codes", Inform. Control, 6:1-13.