Coding: Journal Articles

(For technical reports and conference proceedings, click here.)

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

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

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., Peile, R.E., Pope, S.P., 1987, "An Application of Error Control To Communications", IEEE Communications Mag., Vol. 25, No. 4.

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., 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., 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.

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 -- available here.

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 -- available here.

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., 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., R.C. Bose, and T.A. Dowling (eds.), 1967, "Negacyclic Codes For The Lee Metric", in COMBINATORIAL MATHEMATICS AND ITS APPLICATIONS, University of North Carolina Press, Chapel Hill, North Carolina.

Berlekamp, E.R., and I.M. Jacobs, 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.

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

Berlekamp, E.R., C.E. Shannon, and R.G. Gallager, 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., 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., 1963, "A Class of Convolutional Codes", Inform. Control, 6:1-13.

	Home / Publications / Coding: Journal Articles
Home Publications DVDs Books Patents Journal Articles Codes Games Other Proceedings/Tech Reports Codes Games Other Book Reviews Study Group Reports Translation Theses Videos Research Interests Algorithms Applied Analysis Games Complexity Computer Architecture Encoders Finance Business Information Theory Philanthropy Thesis Students Awards Board Memberships Education / Employment Biographies Contact Information and Site Credits Site Map	Coding: Journal Articles (For technical reports and conference proceedings, click here.) Berlekamp, E.R., 2002, "The Performance of Block Codes", Notices of the AMS, January 2002, 17-22. Berlekamp, E.R., 1996, "Bounded Distance+1 Soft-Decision Reed-Solomon Decoding", IEEE Trans. Inform. Theory, IT 42: 704-720. 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., Peile, R.E., Pope, S.P., 1987, "An Application of Error Control To Communications", IEEE Communications Mag., Vol. 25, No. 4. 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., 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., 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. 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 -- available here. 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 -- available here. 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., 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., R.C. Bose, and T.A. Dowling (eds.), 1967, "Negacyclic Codes For The Lee Metric", in COMBINATORIAL MATHEMATICS AND ITS APPLICATIONS, University of North Carolina Press, Chapel Hill, North Carolina. Berlekamp, E.R., and I.M. Jacobs, 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. Berlekamp, E.R., C.E. Shannon, and R.G.Gallager, 1967, "Lower Bounds To Error Probability For Coding On Discrete Memoryless Channels II", Inform. Control, 10:522-552. Berlekamp, E.R., C.E. Shannon, and R.G. Gallager, 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., 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., 1963, "A Class of Convolutional Codes", Inform. Control, 6:1-13.