2017/03/17 by Joaquim Borges, Borges, J., Josep Rifà +3
Computer Science · Engineering · #Coding theory and cryptography #Combinatorics (math.CO) #Cooperative Communication and Network Coding #FOS: Mathematics #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1703.05929
openalex publication_date 2017/03/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We construct new families of completely regular codes by concatenation methods. By combining parity check matrices of cyclic Hamming codes, we obtain families of completely regular codes. In all cases, we compute the intersection array of these codes. We also study when the extension of these codes gives completely regular codes. Some of these new codes are completely transitive.