Coset codes. I. Introduction and geometrical classification
From MaRDI portal
Publication:3818247
DOI10.1109/18.21245zbMath0665.94018OpenAlexW2165406488MaRDI QIDQ3818247
Publication date: 1989
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/e7cb25e5c4c4870a599b26c27bbe0e7ee3381ede
lattice codesdecoding complexityerror coefficienttrellis-coded modulation schemeslattice partitionband-limited channelsbinary encoderconstellation expansion factor
Related Items
Design of efficient codes for the AWGN channel based on decomposable binary lattices, Lattice Encoding of Cyclic Codes from Skew-Polynomial Rings, Reed-Muller codes and Barnes-Wall lattices: generalized multilevel constructions and representation over \(\mathrm{GF}(2^q)\), Local Testing of Lattices, Nested linear/lattice codes revisited, Lattices from codes over \(\mathbb {Z}_q\): generalization of constructions \(D\), \(D'\) and \(\overline{D}\), Studies on the squaring construction, Connections between Construction D and related constructions of lattices, Construction of Complex Lattice Codes via Cyclotomic Fields, Modular lattices from a variation of construction A over number fields, Polar coding for ring-LWE-based public key encryption, 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, The lattices \(BW_{32}\) and \(U_{32}\) are equivalent, The mathematics of modems, On skew polynomial codes and lattices from quotients of cyclic division algebras
