Some optimal codes have structure

DOI10.1109/49.29612MaRDI QIDQ3495036zbMATH OpenOpenAlexFDO

Authors Rudi de Buda

Publication date 1989

Published in IEEE Journal on Selected Areas in Communications (Search for Journal in Brave)

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

zbMATH Keywords

geometry of numberslattice codesMinkowski-Hlawka theoremrandom codingShannon's theory

Mathematics Subject Classification ID

Information theory (general) (94A15) Coding theorems (Shannon theory) (94A24)

Recommendations

• Averaging bounds for lattices and linear codes
• scientific article; zbMATH DE number 515893
• Any code of which we cannot think is good
• scientific article; zbMATH DE number 3685396
• Publication:3026904

Cited in

(8)

• Algebraic lattice codes for linear fading channels
• Nested linear/lattice codes revisited
• scientific article; zbMATH DE number 515893 (Why is no real title available?)
• Averaging bounds for lattices and linear codes
• Just take the average! An embarrassingly simple \(2^n\)-time algorithm for SVP (and CVP)
• Improved classical and quantum algorithms for the shortest vector problem via bounded distance decoding
• Improved (provable) algorithms for the shortest vector problem via bounded distance decoding
• Solving the shortest vector problem in \(2^{0.63269n+o(n)}\) time on random lattices

This page was built for publication: Some optimal codes have structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3495036)