On the parameters of codes for the Lee and modular distance
暂无分享,去创建一个
[1] B. M. Fulk. MATH , 1992 .
[2] Philippe Delsarte,et al. Four Fundamental Parameters of a Code and Their Combinatorial Significance , 1973, Inf. Control..
[3] Tor Helleseth,et al. On the covering radius of cyclic linear codes and arithmetic codes , 1985, Discret. Appl. Math..
[4] F. C. Piper,et al. FINITE GROUPS OF AUTOMORPHISMS , 1974 .
[5] E. Bannai,et al. Algebraic Combinatorics I: Association Schemes , 1984 .
[6] Arnold Neumaier,et al. Classification of graphs by regularity , 1981, J. Comb. Theory, Ser. B.
[7] Gérard D. Cohen,et al. Covering radius - Survey and recent results , 1985, IEEE Trans. Inf. Theory.
[8] W. W. Peterson,et al. Error-Correcting Codes. , 1962 .
[9] G. Chartrand,et al. A Characterization of Certain Ptolemaic Graphs , 1965, Canadian Journal of Mathematics.
[10] W. Edwin Clark,et al. On modular weight and cyclic nonadjacent forms for arithmetic codes (Corresp.) , 1974, IEEE Trans. Inf. Theory.
[11] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[12] N. J. A. Sloane,et al. Self-Dual Codes over GF(5) , 1982, J. Comb. Theory, Ser. A.
[13] Elwyn R. Berlekamp,et al. Algebraic coding theory , 1984, McGraw-Hill series in systems science.
[14] Jacobus H. van Lint,et al. Introduction to Coding Theory , 1982 .
[15] L. A. Bassalygo. A necessary condition for the existence of perfect codes in Lie metric , 1974 .
[16] Patrick Solé. The Lee Association Scheme , 1986, Coding Theory and Applications.