Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Improved upper bound on the minimum Euclidean distance for block coded phase shift keying
Responsible organisation
2005 (English)Conference paper, (Other academic) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
Linköping, 2005.
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:bth-8646Local ID: oai:bth.se:forskinfo5C7BE44F13539EBCC12573CA005395EEOAI: oai:DiVA.org:bth-8646DiVA: diva2:836394
Conference
RVK - Radiovetenskap och kommunikation
Available from: 2012-09-18 Created: 2008-01-08 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Lennerstad, Håkan
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

Total: 7 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf