Abstract
A proof of V.D. Goppa's (1983) lower bound to the dimension of subfield subcodes of his geometric codes is given. A result on the minimum distance of these subfield subcodes is also given that generalizes the well-known bound: minimum distance of Gamma (L,G)>or=2 deg(G(X))+1 for classical Goppa codes Gamma (L,G) over the field F/sub 2/ with a square-free Goppa polynomial G=G(X).< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call