Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice
暂无分享,去创建一个
[1] Toby Berger,et al. Permutation codes for sources , 1972, IEEE Trans. Inf. Theory.
[2] Neil J. A. Sloane,et al. Complex and integral laminated lattices , 1983 .
[3] N. J. A. Sloane,et al. Fast quantizing and decoding and algorithms for lattice quantizers and codes , 1982, IEEE Trans. Inf. Theory.
[4] N. Sloane,et al. Sphere Packings and Error-Correcting Codes , 1971, Canadian Journal of Mathematics.
[5] J.L. Massey,et al. Theory and practice of error control codes , 1986, Proceedings of the IEEE.
[6] Tai-Yang Hwang. Decoding linear block codes for minimizing word error rate (Corresp.) , 1979, IEEE Trans. Inf. Theory.
[7] Rudolf de Buda,et al. The upper error bound of a new near-optimal code , 1975, IEEE Trans. Inf. Theory.
[8] N. J. A. Sloane,et al. Voronoi regions of lattices, second moments of polytopes, and quantization , 1982, IEEE Trans. Inf. Theory.
[9] Robert J. McEliece,et al. Soft decision decoding of block codes , 1978 .
[10] G. Solomon,et al. A Connection Between Block and Convolutional Codes , 1979 .
[11] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[12] Tai-Yang Hwang. Efficient optimal decoding of linear block codes (Corresp.) , 1980, IEEE Trans. Inf. Theory.
[13] Andrew J. Viterbi,et al. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.
[14] N. J. A. Sloane,et al. On the Classification and Enumeration of Self-Dual Codes , 1975, J. Comb. Theory, Ser. A.
[15] N. J. A. Sloane. A Note on the Leech Lattice as a Code for the Gaussian Channel , 1980, Inf. Control..
[16] Tai-Yang Hwang,et al. Algebraic analog decoding of linear binary codes , 1979, IEEE Trans. Inf. Theory.
[17] Carlos R. P. Hartmann,et al. Generalization of chase algorithms for soft decision decoding of binary linear codes , 1984, IEEE Trans. Inf. Theory.
[18] G. David Forney,et al. Generalized minimum distance decoding , 1966, IEEE Trans. Inf. Theory.
[19] Jacques Wolfmann. A permutation decoding of the (24, 12, 8) Golay code , 1983, IEEE Trans. Inf. Theory.
[20] Robert J. McEliece,et al. Performance of Some Block Codes on a Gaussian Channel , 1975 .
[21] Montgomery Phister,et al. Logical design of digital computers , 1958, Digital design and applications.
[22] N. Sloane,et al. Twenty-three constructions for the Leech lattice , 1982, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.
[23] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[24] C. Hackett. An Efficient Algorithm for Soft-Decision Decoding of the (24, 12) Extended Golay Code , 1981, IEEE Trans. Commun..
[25] Allen Gersho,et al. Asymptotically optimal block quantization , 1979, IEEE Trans. Inf. Theory.
[26] D. Slepian. Permutation Modulation , 1965, Encyclopedia of Wireless Networks.
[27] Allen Gersho,et al. On the structure of vector quantizers , 1982, IEEE Trans. Inf. Theory.
[28] B. Dorsch,et al. A decoding algorithm for binary block codes and J -ary output channels (Corresp.) , 1974, IEEE Trans. Inf. Theory.
[29] E. C. Posner. Combinatorial structures in planetary reconnaissance. , 1968 .
[30] J. Lepowsky,et al. An E8-approach to the Leech lattice and the Conway group☆ , 1982 .
[31] J. Leech. Notes on Sphere Packings , 1967, Canadian Journal of Mathematics.
[32] N. J. A. Sloane,et al. The Unimodular Lattices of Dimension up to 23 and the Minkowski-Siegel Mass Constants , 1982, Eur. J. Comb..
[33] E.R. Berlekamp,et al. The technology of error-correcting codes , 1980, Proceedings of the IEEE.
[34] Neil J. A. Sloane,et al. Lorentzian forms for the Leech lattice , 1982 .
[35] Daniel M. Gordon. Minimal permutation sets for decoding the binary Golay codes , 1982, IEEE Trans. Inf. Theory.
[36] John H. Conway. The Golay Codes and The Mathieu Groups , 1988 .
[37] Jack K. Wolf,et al. Efficient maximum likelihood decoding of linear block codes using a trellis , 1978, IEEE Trans. Inf. Theory.
[38] E. Gilbert. Gray codes and paths on the N-cube , 1958 .
[39] Jr. G. Forney,et al. The viterbi algorithm , 1973 .
[40] Robert J. McEliece,et al. Decoding with multipliers , 1976 .
[41] John H. Conway,et al. On the Enumeration of Self-Dual Codes , 1980, J. Comb. Theory, Ser. A.
[42] Ian F. Blake. The Leech Lattice as a Code for the Gaussian Channel , 1971, Inf. Control..
[43] David Chase,et al. Class of algorithms for decoding block codes with channel measurement information , 1972, IEEE Trans. Inf. Theory.
[44] N. Sloane,et al. On the Voronoi Regions of Certain Lattices , 1984 .
[45] Vera Pless. The children of the (32, 16) doubly even codes , 1978, IEEE Trans. Inf. Theory.
[46] Carlos R. P. Hartmann,et al. An optimum symbol-by-symbol decoding rule for linear codes , 1976, IEEE Trans. Inf. Theory.
[47] N. J. A. Sloane,et al. Tables of sphere packings and spherical codes , 1981, IEEE Trans. Inf. Theory.
[48] Gustave Solomon,et al. Convolutional Coding Techniques for Certain Quadratic Residual Codes , 1975 .
[49] E. Reingold,et al. Combinatorial Algorithms: Theory and Practice , 1977 .
[50] N. Sloane,et al. On the enumeration of lattices of determinant one , 1982 .
[51] Toby Berger. Optimum quantizers and permutation codes , 1972, IEEE Trans. Inf. Theory.
[52] Hans Niemeier. Definite quadratische formen der dimension 24 und diskriminante 1 , 1973 .
[53] Philippe Delsarte. Partial-optimal piecewise decoding of linear codes , 1978, IEEE Trans. Inf. Theory.
[54] N. J. A. Sloane,et al. A fast encoding method for lattice codes and quantizers , 1983, IEEE Trans. Inf. Theory.
[55] Philippe Godlewski,et al. Replication decoding , 1979, IEEE Trans. Inf. Theory.