Goppa codes that are better than the Varshamov-Gilbert bound
From MaRDI portal
Publication:788695
zbMath0531.94015MaRDI QIDQ788695
Publication date: 1983
Published in: Problems of Information Transmission (Search for Journal in Brave)
94B05: Linear codes (general theory)
94B60: Other types of codes
14H99: Curves in algebraic geometry
Related Items
A new upper bound on nonbinary block codes, Algebraic-geometric codes and asymptotic problems, A construction of some \([n,k,d;q\)-codes meeting the Griesmer bound]