2018/01/06 by Shyambhu Mukherjee, Mukherjee, Shyambhu, Joydeb Pal +3
Computer Science · Mathematics · #15A24 #94B05 #94B35 #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT #msc:15A24 #msc:94B05 #msc:94B35
paper · pdf · doi:10.48550/arxiv.1801.02010
8 pages
arxiv created 2018/01/06 · arxiv updated 2018/01/09
One of the main weakness of the family of centralizer codes is that its length is always n2. Thus we have taken a new matrix equation code called intertwining code. Specialty of this code is the length of it, which is of the form nk. We establish two decoding methods which can be fitted to intertwining codes as well as for any linear codes. We also show an inclusion of linear codes into a special class of intertwining codes.