2022/12/08 by Malyugin, Sergei A.
#94B05 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT)
paper · doi:10.48550/arxiv.2212.04361
In this paper, we propose a general construction of linear perfect codes over infinite skew fields and quasi skew fields with right (left) unity. A complete classification of such codes over associative skew fields is given. Since the cardinality of the considered skew fields is infinite, the constructed codes have an infinite length. In the previous work, we considered codes over infinite countable fields, the length of which was also countable. We now remove this restriction and consider that the cardinality of the skew field and the length of the codes can be arbitrary (not necessarily countable).