Asymptotically Good Codes Over Non-Abelian Groups
Information Theory
2012-02-22 v2 math.IT
Abstract
It has been shown that good structured codes over non-Abelian groups do exist. Specifically, we construct codes over the smallest non-Abelian group and show that the performance of these codes is superior to the performance of Abelian group codes of the same alphabet size. This promises the possibility of using non-Abelian codes for multi-terminal settings where the structure of the code can be exploited to gain performance.
Keywords
Cite
@article{arxiv.1202.0863,
title = {Asymptotically Good Codes Over Non-Abelian Groups},
author = {Aria G. Sahebi and S. Sandeep Pradhan},
journal= {arXiv preprint arXiv:1202.0863},
year = {2012}
}