Generalized minimum-distance decoding of Euclidean-space codes and lattices
From MaRDI portal
Publication:3129484
Recommendations
- Generalized minimum distance decoding in Euclidean space: performance analysis
- scientific article; zbMATH DE number 4104869
- On Bounded Distance Decoding for General Lattices
- Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes
- Minimum distance and pseudodistance lower bounds for generalised LDPC codes
- A bounded-distance decoding algorithm for lattices obtained from a generalized code formula
- An improvement to generalized-minimum-distance decoding
- scientific article; zbMATH DE number 1047549
- Generalized minimum distance decoding algorithms for Qary output channels (Corresp.)
- Two classes of minimum generalized distance decoding algorithms
Cited in
(8)- Generalized minimum distance decoding in Euclidean space: performance analysis
- On a Sufficient Condition to Attain Minimum Square Distance in Euclidean Codes
- Minimum Distance Decoding of General Algebraic Geometry Codes via Lists
- scientific article; zbMATH DE number 6820265 (Why is no real title available?)
- Generalized minimum distance decoding algorithms for Qary output channels (Corresp.)
- Reed-Muller codes and Barnes-Wall lattices: generalized multilevel constructions and representation over \(\mathrm{GF}(2^q)\)
- List-decoding Barnes-Wall lattices
- A lattice-based McEliece scheme for encryption and signature
This page was built for publication: Generalized minimum-distance decoding of Euclidean-space codes and lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3129484)