Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization

DOI10.1016/j.disc.2010.04.025zbMath1226.94023OpenAlexW1970963951MaRDI QIDQ712251

Håkan Lennerstad, Magnus Nilsson, Efraim Laksman

Publication date: 28 October 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.04.025

zbMATH Keywords

block codeElias boundminimal Euclidean distancephase shift keying

Mathematics Subject Classification ID

Bounds on codes (94B65) Combined modulation schemes (including trellis codes) in coding theory (94B12) Modulation and demodulation in information and communication theory (94A14)

Related Items

Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization ⋮ The n-dimensional Stern–Brocot tree

Cites Work

• Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization
• Bounds for codes over the unit circle
• A new multilevel coding method using error-correcting codes
• An upper bound on the minimum Euclidean distance for block-coded phase-shift keying
• Bounds on Communication with Polyphase Coding
• Unnamed Item
• Unnamed Item
• Unnamed Item