On decoding procedures of intertwining codes

January 06, 2018 Β· Declared Dead Β· πŸ› Journal of Discrete Mathematical Sciences and Cryptography

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Shyambhu Mukherjee, Joydeb Pal, Satya Bagchi arXiv ID 1801.02010 Category cs.IT: Information Theory Citations 0 Venue Journal of Discrete Mathematical Sciences and Cryptography Last Checked 4 months ago
Abstract
One of the main weakness of the family of centralizer codes is that its length is always $n^2$. 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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted