Bounds for codes over the unit circle

DOI10.1109/TIT.1986.1057230MaRDI QIDQ3757828zbMATH OpenFDO

Authors Ph. Piret

Publication date 1986

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

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

zbMATH Keywords

achievable rateblock codesKabatyanskii- Levenshtein boundlower boundupper bound

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Recommendations

• scientific article; zbMATH DE number 774615
• Upper bounds on the minimum distance of spherical codes
• Constructive spherical codes near the Shannon bound
• scientific article; zbMATH DE number 1057745
• Algebraic-geometric codes and asymptotic problems

Cited in

(7)

• Self-dual codes over the integers modulo 4
• An upper bound on the minimum Euclidean distance for block-coded phase-shift keying
• Upper bounds and Hamming spheres under the DC constraint
• Generalized upper bounds on the minimum distance of PSK block codes
• Small codes
• Block codes for dyadic phase shift keying
• Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization

This page was built for publication: Bounds for codes over the unit circle

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