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

Document type: Conference Papers
Peer reviewed: No
Author(s): Magnus Nilsson, Håkan Lennerstad
Title: Improved upper bound on the minimum Euclidean distance for block coded phase shift keying
Conference name: RVK - Radiovetenskap och kommunikation
Year: 2005
Pagination: 659-662
City: Linköping
Organization: Blekinge Institute of Technology
Department: School of Engineering - Dept. Mathematics and Science (Sektionen för teknik – avd. för matematik och naturvetenskap)
School of Engineering S- 371 79 Karlskrona
+46 455 38 50 00
http://www.tek.bth.se/
Authors e-mail: hakan.lennerstad@bth.se
Language: English
Abstract: In an earlier work we presented and upper bound on the minimum Euclidean distance for block coded phase shift keying. The bound presented is valid for any alphabet size q\geq4, but it applies only to codes with medium or high rates: codes for which |C|>(q/3)^n. Here |C| is the number of codewords and n is the block length. The bound is proven to be tight for many parameter values at high rates.
In this paper we present for the case q=8 an improved upper bound. This bound is tighter at medium rates, and is valid for all rates.
Subject: Telecommunications\Coding Theory
Edit