Quaternary convolutional codes from linear block codes over Galois rings

Issue Date

5-2007

Abstract

From a linear block code B over the Galois ring GR(4, m) with a k × n generator matrix and minimum Hamming distance d, a rate-k/n convolutional code over the ring ℤ4 with squared Euclidean free distance at least 2d and a non-recursive encoder with memory at most m - 1 is constructed. When the generator matrix of B is systematic, the convolutional encoder is systematic, basic, non-catastrophic and minimal. Long codes constructed in this manner are shown to satisfy a Gilbert-Varshamov bound. ©2007 IEEE.

Source or Periodical Title

IEEE International Symposium on Information Theory - Proceedings

ISSN

21578101

Volume

53

Issue

6

Page

2641-2645

Document Type

Article

Language

English

Subject

Convolutional codes over rings, Galois rings, Homogeneous weight, Squared euclidean free distance

Identifier

doi: 10.1109/TIT.2007.896884.

Digital Copy

YES

Link to Full Text

Share

COinS