Constacyclic codes, cocycles and a u+v|u-v construction
IEEE Transactions on Information Theory
On algebraic construction of Gallager and circulant low-density parity-check codes
IEEE Transactions on Information Theory
LDPC block and convolutional codes based on circulant matrices
IEEE Transactions on Information Theory
Some randomized code constructions from group actions
IEEE Transactions on Information Theory
Algebraic constructions of LDPC codes with no short cycles
International Journal of Information and Coding Theory
A group ring construction of the [48,24,12] type II linear block code
Designs, Codes and Cryptography
Hi-index | 0.00 |
A new construction method for codes using encodings from group rings is described and presented. They consist primarily of two types: zero-divisor and unit derived codes. Previous codes from group rings focused on ideals; for example, cyclic codes are ideals in the group ring over a cyclic group. The fresh focus is on the encodings themselves, which only under very limited conditions result in ideals. The authors use the result that a group ring is isomorphic to a certain well-defined ring of matrices and thus, every group ring element has an associated matrix. This allows matrix algebra to be used as needed in the study and production of codes, enabling the creation of standard generator and check matrices. Group rings are a fruitful source of units and zero-divisors from which new codes result. Many code properties, such as being LDPC or self-dual, may be expressed as properties within the group ring, thus enabling the construction of codes with these properties. The methods are general enabling the construction of codes with many types of group rings. There is no restriction on the ring and thus codes over the integers, over matrix rings or even over group rings themselves are possible and fruitful.