An upper bound on the minimum Euclidean distance for block-coded phase-shift keying

DOI10.1109/18.825837zbMath1002.94049OpenAlexW2123679567MaRDI QIDQ4503543

Magnus Nilsson, Håkan Lennerstad

Publication date: 7 September 2000

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

Full work available at URL: https://doi.org/10.1109/18.825837

zbMATH Keywords

upper boundnonlinear codesblock codescoded modulationphase shift keyingminimum Euclidean distancemultilevel codes

Mathematics Subject Classification ID

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

Related Items (1)

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

This page was built for publication: An upper bound on the minimum Euclidean distance for block-coded phase-shift keying