Cyclic distances of idempotent convolutional codes. (January 2021)

• Record Type: Journal Article
• Authors: Gómez-Torrecillas, José; Lobillo, F.J.; Navarro, Gabriel
• Is Part Of: Journal of symbolic computation. Volume 102(2020)
• Page Start: 37
• Page End: 62
• Publication Date: 2021-01
• Subjects: Cyclic convolutional code -- Free distance -- Column and row distances -- Brouwer–Zimmermann algorithm; Mathematics -- Data processing -- Periodicals; Numerical analysis -- Data processing -- Periodicals; Automatic programming (Computer science) -- Periodicals; Mathématiques -- Informatique -- Périodiques; Analyse numérique -- Informatique -- Périodiques; Programmation automatique -- Périodiques; Automatic programming (Computer science); Mathematics -- Data processing; Numerical analysis -- Data processing; Periodicals; Electronic journals; 510.285
• DOI: 10.1016/j.jsc.2019.10.008
• Languages: English
• ISSNs: 0747-7171

Abstract

Abstract: We show that, for convolutional codes endowed with a cyclic structure, it is possible to define and compute two sequences of positive integers, called cyclic column and row distances, which present a more regular behavior than the classical column and row distance sequences. We then design an algorithm for the computation of the free distance based on the calculation of the cyclic column distance sequence.