On Codes From Residue Class Ring Generated Finite Ferrero Pairs
- 149 Downloads
In the sequel we consider error-correcting codes constructed from the incidence matrix of a BIB-design, which is generated by a finite Ferrero pair based on a residue class ring. Codes from BIB-designs are already known for often having good properties concerning error-correction. Unfortunately many of the considered codes seem to have a lower quality at the first glance. But via the simple trick of omitting a few of the codewords it is possible to highly improve the quality of these codes. This method also simplifies the calculation of the error-correcting properties and does not affect very much the size of the codes. Also other calculations, like encoding and decoding, do not become harder. After an overview of the general method of constructing codes from finite Ferrero pairs we characterize the case of residue class ring generated ones and then we draw our attention on what the resulting codes look like.
KeywordsIncidence Matrix Frobenius Group Invariant Subgroup Finite Ring Block Intersection
Unable to display preview. Download preview PDF.
- 2.J. R. Clay, Near-Rings: Geneses and Applications (Oxford Univ. Press, 1992).Google Scholar
- 3.R. A. Eggetsberger, Some Topics in Frobenius Groups, BIB-Designs and Coding Theory (Contributions to General Algebra 8, Hölder-Pichler-Tempsky/Teubner, Wien/Stuttgart, 1992), P. 45–56.Google Scholar
- 6.W.-F. Ke and H. Kiechle, Characterization of Some Finite Ferrero Pairs (to appear).Google Scholar
- 9.G. Pilz, Codes, Block Designs, Frobenius Groups and Near-Rings (Combinatorics 90, Elsevier Science Publishers B.V. 1992) P. 471–476.Google Scholar