Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization
DOI10.1016/J.DISC.2010.04.025zbMATH Open1226.94023OpenAlexW1970963951MaRDI QIDQ712251FDOQ712251
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
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
Bounds on codes (94B65) Modulation and demodulation in information and communication theory (94A14) Combined modulation schemes (including trellis codes) in coding theory (94B12)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new multilevel coding method using error-correcting codes
- Bounds for codes over the unit circle
- An upper bound on the minimum Euclidean distance for block-coded phase-shift keying
- Bounds on Communication with Polyphase Coding
- Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization
Cited In (5)
- 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
- An upper bound on the minimum Euclidean distance for block-coded phase-shift keying
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)
