Coset codes. II. Binary lattices and related codes

DOI10.1109/18.21246zbMath0665.94019OpenAlexW2168226105MaRDI QIDQ3818248

G. David jun. Forney

Publication date: 1989

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.21246

zbMATH Keywords

partitionsdistancesReed-Muller codesdimensionsLeech latticeBarnes-Wall latticesGolay codeNordstrom-Robinson codegenerator matricesduality propertiessquaring constructionmaximum likelihood decoding algorithms

Mathematics Subject Classification ID

Cyclic codes (94B15)

Related Items (30)

Matrix-product structure of repeated-root cyclic codes over finite fields ⋮ Design of efficient codes for the AWGN channel based on decomposable binary lattices ⋮ A new sphere packing in 20 dimensions ⋮ Reed-Muller codes and Barnes-Wall lattices: generalized multilevel constructions and representation over \(\mathrm{GF}(2^q)\) ⋮ On the intersection of binary linear codes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Nested linear/lattice codes revisited ⋮ Lattices from codes over \(\mathbb {Z}_q\): generalization of constructions \(D\), \(D'\) and \(\overline{D}\) ⋮ A family of optimal packings in Grassmannian manifolds ⋮ List-decoding Barnes-Wall lattices ⋮ Studies on the squaring construction ⋮ Connections between Construction D and related constructions of lattices ⋮ On the number of lattice points in a small sphere and a recursive lattice decoding algorithm ⋮ Construction of Complex Lattice Codes via Cyclotomic Fields ⋮ On viewing block codes as finite automata. ⋮ Matrix product codes over finite commutative Frobenius rings ⋮ On trellis structures for Reed-Muller codes ⋮ Universal codes and unimodular lattices ⋮ Bounds for the \(l_1\)-distance of \(q\)-ary lattices obtained via constructions \(\mathrm D\), \(\mathrm D'\) and \(\overline{\mathrm D}\) ⋮ Adaptive coset partition for distributed video coding ⋮ On quintic quasi-cyclic codes ⋮ The lattices \(BW_{32}\) and \(U_{32}\) are equivalent ⋮ Lattices of quasi-cyclic codes ⋮ On maximum length convolutional codes under a trellis complexity constraint ⋮ On Viterbi-like algorithms and their application to Reed-Muller codes ⋮ Dense sphere packings from new codes ⋮ The separation of binary relative three-weight codes and its applications ⋮ Matrix theory for minimal trellises ⋮ Trellis complexity and pseudoredundancy of relative two-weight codes

This page was built for publication: Coset codes. II. Binary lattices and related codes