Bounds for codes over the unit circle

DOI10.1109/TIT.1986.1057230zbMATH Open0619.94016MaRDI QIDQ3757828FDOQ3757828

Ph. Piret

Publication date: 1986

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

zbMATH Keywords

lower boundupper boundblock codesachievable rateKabatyanskii- Levenshtein bound

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Cited In (3)

• Block codes for dyadic phase shift keying
• Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization
• Self-dual codes over the integers modulo 4

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)