Abstract
Several efficient error-correcting codes are ideals in certain ring constructions. We consider two-sided ideals in structural matrix rings defined in terms of directed graphs with the set of vertices corresponding to rows and columns, and with edges corresponding to nonzero entries in matrices of the ring. Formulas for Hamming weights of all ideals in structural matrix rings are found and sharp upper bounds for information rates of these ideals are given.
Cite
CITATION STYLE
Kelarev, A., & Sokratova, O. (2001). Information rates and weights of codes in structural matrix rings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2227, pp. 151–158). Springer Verlag. https://doi.org/10.1007/3-540-45624-4_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
