Can I read Upper Bound on Minimal Euclidean Distance on EtoBox?

Upper Bound on Minimal Euclidean Distance by avivro is a document available to read on EtoBox.

What is Upper Bound on Minimal Euclidean Distance about?

The paper presents an upper bound on the minimum Euclidean distance for block-coded phase-shift keying codes. The bound is given as a function of the alphabet size, code size, and other parameters. The paper proves the bound through four theorems and applies it to existing codes. The techniques used are similar to methods for obtaining bounds seen in information theory courses. The bound does not require an infinite alphabet or code length, representing an advantage over prior work.

Author

avivro

Language

EN