Alternant code

#	Item
1	Chapter 7 Codes over Subfields In Chapter 6 we looked at various general methods for constructing new codes from old codes. Here we concentrate on two more specialized techniques that result from writing the field F as Add to Reading List Source URL: www.mth.msu.edu Language: English - Date: 2012-08-31 11:04:32 Mathematics Notation Binary Golay code Ternary Golay code Linear code Reed–Solomon error correction Alternant code Dual code Generator matrix Coding theory Error detection and correction Finite fields
2	Polynomial Time Attack on Wild McEliece Over Quadratic Extensions Alain Couvreur1 , Ayoub Otmani2 , and Jean–Pierre Tillich3 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2014-02-13 14:34:46 Mathematics Goppa code Alternant code McEliece cryptosystem Reed–Solomon error correction Linear code Reed–Muller code Algebraic geometry Coding theory Finite fields Error detection and correction
3	PDF Document Add to Reading List Source URL: orion.math.iastate.edu Language: English - Date: 2004-12-20 17:36:38 Goppa code Gilbert–Varshamov bound Linear code Singleton bound McEliece cryptosystem Reed–Solomon error correction Generator matrix Code Alternant code Coding theory Mathematics Notation