论文信息 - The Bounds of Delsarte and Lovász, and Their Applications to Coding Theory - 字舞流文

The Bounds of Delsarte and Lovász, and Their Applications to Coding Theory

Our object in this article is to introduce the reader to two important topics in coding theory, and to a recently developed mathematical tool that can be used to derive some extremely important results about them.

Robert J. McEliece | R. McEliece

[1] G. Birkhoff,et al. A survey of modern algebra , 1942 .

[2] N. J. A. Sloane,et al. Bounds for binary codes of length less than 25 , 1978, IEEE Trans. Inf. Theory.

[3] W. Greub. Linear Algebra , 1981 .

[4] László Lovász,et al. On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[5] Pierre Samuel,et al. Algebraic theory of numbers , 1971 .

[6] R. McEliece,et al. The Lovasz bound and some generalizations , 1978 .

[7] C. C. Macduffee,et al. The Theory of Matrices , 1933 .

[8] Elwyn R. Berlekamp,et al. Key Papers in the Development of Coding Theory , 1974 .

[9] H. Wielandt,et al. Finite Permutation Groups , 1964 .

[10] Willem H. Haemers,et al. On Some Problems of Lovász Concerning the Shannon Capacity of a Graph , 1979, IEEE Trans. Inf. Theory.

[11] Claude E. Shannon,et al. The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.

[12] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .

[13] Robert J. McEliece,et al. New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities , 1977, IEEE Trans. Inf. Theory.