Du är här

Some rate 1/3 and 1/4 binary convolutional codes with an optimum distance profile

Författare:
Publiceringsår: 1977
Språk: Engelska
Sidor: 281-283
Publikation/Tidskrift/Serie: IEEE Transactions on Information Theory
Volym: 23
Nummer: 2
Dokumenttyp: Artikel

Sammanfattning

A tabulation of binary systematic convolutional codes with an optimum distance profile for rates1/3and1/4is given. A number of short rate1/3binary nonsystematic convolutional codes are listed. These latter codes are simultaneously optimal for the following distance measures: distance profile, minimum distance, and free distance; they appear attractive for use with Viterbi decoders. Comparisons with previously known codes are made.

Disputation

Nyckelord

  • Technology and Engineering

Övriga

Published
Yes
"This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder."
  • ISSN: 0018-9448

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

LERU logotype U21 logotype

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen