Decomposition of cyclic codes of block lengths $3p, 5p, 7p$ (Corresp.)

Author

MacWilliams, F. Jessie

Volume

Issue

fYear

1979

fDate

1/1/1979 12:00:00 AM

Firstpage

112

Lastpage

118

Abstract

V. K. Bhargava recently made the following suggestion. Let $C$ he a cyclic code of dimension $p$ , and block length $n$ , where $n = tp, p$ is a prime. It is sometimes possible to find a code equivalent to $C$ which has a generator matrix of the form $[I|A_{1}| \\cdots |A_{t-1}]$ where each $A_{i}$ is a $p \\times p$ circulant matrix. Such a decomposition is useful in encoding and decoding and also in finding the weight distribution of $C$ . Some general theory as to

Keywords

Cyclic codes; Decoding; Encoding; Error correction codes; Error probability; Matrix decomposition; Welding;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/TIT.1979.1055992

Filename

1055992

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=929598

Decomposition of cyclic codes of block lengths (Corresp.)

MacWilliams, F. Jessie

jour

Decomposition of cyclic codes of block lengths $3p, 5p, 7p$ (Corresp.)