Computing Extensions of Linear Codes

Details Computing Extensions of Linear Codes Computing Extensions of Linear Codes

2007-04-19

arxiv.org/abs/0704.2596v1

Proceedings 2007 IEEE International Symposium on Information Theory (ISIT 2007), Nice, France, June 2007, pp. 476-480

Computer Science

Information Theory

accepted for publication at ISIT 07

Scientific paper

10.1109/ISIT.2007.4557095

This paper deals with the problem of increasing the minimum distance of a
linear code by adding one or more columns to the generator matrix. Several
methods to compute extensions of linear codes are presented. Many codes
improving the previously known lower bounds on the minimum distance have been
found.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-213521