Title :
A link between quasi-cyclic codes and convolutional codes
Author :
Esmaeili, Morteza ; Gulliver, T. Aaron ; Secord, Norman P. ; Mahmoud, Samy A.
Author_Institution :
Dept. of Math. & Stat., Carleton Univ., Ottawa, Ont., Canada
fDate :
1/1/1998 12:00:00 AM
Abstract :
Given a quasi-cyclic code with minimum Hamming distance d, a set of convolutional codes is derived with free distance equal to d. It is shown that an increase in the rate of these codes results in a decrease in the memory length. The connection between these codes is illustrated with several well-known quasi-cyclic codes. The free distance of some partial unit memory convolutional codes can be determined using the results in this correspondence
Keywords :
Golay codes; Reed-Muller codes; block codes; convolutional codes; cyclic codes; matrix algebra; Golay codes; Reed-Muller codes; code rate increase; convolutional codes; free distance; memory length decrease; minimum Hamming distance; partial unit memory convolutional codes; quasi-cyclic codes; Block codes; Convolution; Convolutional codes; Councils; Hamming distance; Mathematics; Statistics; Systems engineering and theory; Wireless networks;
Journal_Title :
Information Theory, IEEE Transactions on
