Asymptotically Good Codes Over Non-Abelian Groups

Details Asymptotically Good Codes Over Non-Abelian Groups Asymptotically Good Codes Over Non-Abelian Groups

2012-02-04

arxiv.org/abs/1202.0863v2

Computer Science

Information Theory

Scientific paper

It has been shown that good structured codes over non-Abelian groups do exist. Specifically, we construct codes over the smallest non-Abelian group $\mathds{D}_6$ 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.

Affiliated with

Also associated with

No associations

Rating

Asymptotically Good Codes Over Non-Abelian Groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Asymptotically Good Codes Over Non-Abelian Groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotically Good Codes Over Non-Abelian Groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-329957