Document Type

Article

Publication Date

3-1999

Publication Title

Faculty Publications

Volume

45

Issue Number

2

First Page

725

Last Page

731

DOI

10.1109/18.749022

Abstract

In this correspondence, constructions of generalized concatenated (GC) codes with good rates and distances are presented. Some of the proposed GC codes have simpler trellis omplexity than Euclidean geometry (EG), Reed–Muller (RM), or Bose–Chaudhuri–Hocquenghem (BCH) codes of approximately the same rates and minimum distances, and in addition can be decoded with trellis-based multistage decoding up to their minimum distances. Several codes of the same length, dimension, and minimum distance as the best linear codes known are constructed.

Comments

Published in IEEE Transactions on Information Theory.March 1999: 45 (2): 725-731.

© 1999 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The definitive version is available at http://dx.doi.org/10.1109/18.749022.

At the time of publication Robert H. Morelos-Zaragoza was not yet affiliated with San Jose State University.

Download
COinS