On decoding procedures of intertwining codes

Article Type

Research Article

Publication Title

Journal of Discrete Mathematical Sciences and Cryptography

Abstract

The barrier of the family of centralizer codes is the length which is always n 2. In our paper, we have taken codes generated by two matrices A and C of different orders n × n and k × k respectively. This family of codes are termed as intertwining codes and denoted by (Figure presented.). Specialty of this code is the length nk which gives a new approach to characterize family of centralizer codes. In this article, we show an upper bound on the minimum distance of intertwining codes. Besides, we establish two decoding methods which can be fitted to intertwining codes as well as for any linear codes. Moreover, we have shown a condition for which a linear code can be represented as an intertwining code.

First Page

955

Last Page

964

DOI

10.1080/09720529.2019.1688970

Publication Date

1-1-2021

Comments

Open Access, Green

This document is currently not available here.

Share

COinS