Generalized upper bounds on the minimum distance of PSK block codes

DOI10.1093/IMAMCI/DNT047zbMATH Open1357.94043OpenAlexW2117973937MaRDI QIDQ5264367FDOQ5264367

Authors: Efraim Laksman, Håkan Lennerstad, Magnus Nilsson 

Publication date: 27 July 2015

Published in: IMA Journal of Mathematical Control and Information (Search for Journal in Brave)

Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-6608

Recommendations

• An upper bound on the minimum Euclidean distance for block-coded phase-shift keying
• Constructions and properties of block codes for partial-response channels
• Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization
• Bounds on the minimum distance of trellis codes
• Bounds for codes over the unit circle

zbMATH Keywords

Elias boundasymmetric PSKsymmetric PSK

Mathematics Subject Classification ID

Bounds on codes (94B65) Modulation and demodulation in information and communication theory (94A14)

Cited In (2)

• Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization
• An upper bound on the minimum Euclidean distance for block-coded phase-shift keying

This page was built for publication: Generalized upper bounds on the minimum distance of PSK block codes

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