Long Nonbinary Codes Exceeding the Gilbert - Varshamov Bound for any Fixed Distance

Details Long Nonbinary Codes Exceeding the Gilbert - Varshamov Bound for any Fixed Distance Long Nonbinary Codes Exceeding the Gilbert - Varshamov Bound for any Fixed Distance

2004-06-21

arxiv.org/abs/cs/0406039v3

Computer Science

Information Theory

Submitted to IEEE Trans. on Info. Theory

Scientific paper

Let A(q,n,d) denote the maximum size of a q-ary code of length n and distance d. We study the minimum asymptotic redundancy \rho(q,n,d)=n-log_q A(q,n,d) as n grows while q and d are fixed. For any d and q<=d-1, long algebraic codes are designed that improve on the BCH codes and have the lowest asymptotic redundancy \rho(q,n,d) <= ((d-3)+1/(d-2)) log_q n known to date. Prior to this work, codes of fixed distance that asymptotically surpass BCH codes and the Gilbert-Varshamov bound were designed only for distances 4,5 and 6.

Affiliated with

Also associated with

No associations

Rating

Long Nonbinary Codes Exceeding the Gilbert - Varshamov Bound for any Fixed Distance 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 Long Nonbinary Codes Exceeding the Gilbert - Varshamov Bound for any Fixed Distance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Long Nonbinary Codes Exceeding the Gilbert - Varshamov Bound for any Fixed Distance will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-57353