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

DOI10.1016/J.DISC.2010.04.025MaRDI QIDQ712251zbMATH OpenOpenAlexFDO

Authors Efraim Laksman, Håkan Lennerstad, Magnus Nilsson

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) Modulation and demodulation in information and communication theory (94A14) Combined modulation schemes (including trellis codes) in coding theory (94B12)

Recommendations

• An upper bound on the minimum Euclidean distance for block-coded phase-shift keying
• On a Sufficient Condition to Attain Minimum Square Distance in Euclidean Codes
• scientific article; zbMATH DE number 702178
• scientific article; zbMATH DE number 4062994
• On the Optimum Distance Profiles About Linear Block Codes
• Generalized minimum distance decoding in Euclidean space: performance analysis
• Minimum distance and pseudodistance lower bounds for generalised LDPC codes
• Improvement on minimum distance of symbol-pair codes
• Minimum Euclidean distance for combinations of short rate 1/2 convolutional codes and CPFSK modulation
• Generalized upper bounds on the minimum distance of PSK block codes

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 3318360 (Why is no real title available?)
• A new multilevel coding method using error-correcting codes
• An upper bound on the minimum Euclidean distance for block-coded phase-shift keying
• Bounds for codes over the unit circle
• Bounds on Communication with Polyphase Coding
• Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization

Cited in

(5)

• An upper bound on the minimum Euclidean distance for block-coded phase-shift keying
• The \(n\)-dimensional Stern-Brocot tree
• Generalized upper bounds on the minimum distance of PSK block codes
• Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization
• Improvement on minimum distance of symbol-pair codes

This page was built for publication: Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization

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