Chain of Separable Binary Goppa Codes and their Minimal Distance

Details Chain of Separable Binary Goppa Codes and their Minimal Distance Chain of Separable Binary Goppa Codes and their Minimal Distance

2007-07-27

arxiv.org/abs/0707.4083v1

Computer Science

Information Theory

7 pages, 1 figure

Scientific paper

It is shown that subclasses of separable binary Goppa codes, $\Gamma(L,G)$ -
codes, with $L=\{\alpha \in GF(2^{2l}):G(\alpha)\neq 0 \}$ and special Goppa
polynomials G(x) can be presented as a chain of embedded codes. The true
minimal distance has been obtained for all codes of the chain.

Affiliated with

Also associated with

No associations

Rating

Chain of Separable Binary Goppa Codes and their Minimal 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 Chain of Separable Binary Goppa Codes and their Minimal Distance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Chain of Separable Binary Goppa Codes and their Minimal Distance will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-271717