New Minimum Distance Bounds for Linear Codes over Small Fields
Problems of Information Transmission
New One-Generator Quasi-cyclic Codes over GF(7)
Problems of Information Transmission
On the Algebraic Structure of Quasi-cyclic Codes II: Chain Rings
Designs, Codes and Cryptography
New Quasi-cyclic Degenerate Linear Codes over GF(8)
Problems of Information Transmission
New Minimum Distance Bounds for Linear Codes over GF(9)
Problems of Information Transmission
Discrete Applied Mathematics
Geometrically-structured maximum-girth LDPC block and convolutional codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Pseudocodeword performance analysis for LDPC convolutional codes
IEEE Transactions on Information Theory
Structural properties and enumeration of 1-generator generalized quasi-cyclic codes
Designs, Codes and Cryptography
Hi-index | 754.90 |
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