Sixteen New Linear Codes With Plotkin Sum

Details Sixteen New Linear Codes With Plotkin Sum Sixteen New Linear Codes With Plotkin Sum

2008-04-22

arxiv.org/abs/0804.3507v1

Computer Science

Information Theory

Submitted to IEEE Trans. Information Theory

Scientific paper

Sixteen new linear codes are presented: three of them improve the lower bounds on the minimum distance for a linear code and the rest are an explicit construction of unknown codes attaining the lower bounds on the minimum distance. They are constructed using the Plotkin sum of two linear codes, also called $(u|u+v)$ construction. The computations have been achieved using an exhaustiv search.

Affiliated with

Also associated with

No associations

Rating

Sixteen New Linear Codes With Plotkin Sum 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 Sixteen New Linear Codes With Plotkin Sum, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sixteen New Linear Codes With Plotkin Sum will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-675222