Summary

The 2018 International Symposium on Information Theory and Its Applications (ISITA2018)

2018

Session Number:We-AM-Poster

Session:

Number:We-AM-Poster.24

Generating Binary Quasi-Cyclic Reversible Codes

Ramy Taki ElDin,  Hajime Matsui,  

pp.514-514

Publication Date:2018/10/18

Online ISSN:2188-5079

DOI:10.34385/proc.55.We-AM-Poster.24

PDF download

PayPerView

Summary:
We propose an algorithm to generate a binary quasicyclic reversible code C of even index ? and codeword length ?n, where n is odd. Firstly, a cyclic code C over the Galois field F2? of odd codeword length n is generated. Then, C is derived from C by unfolding elements of F2? to their binary representations. A condition on the defining set S of C is established to ensure that C is a binary ?-quasi-cyclic reversible code.