The following pages link to Codes and information (Q3701328):
Displaying 32 items.
- Near weights on higher dimensional varieties (Q329183) (← links)
- On the small-weight codewords of some Hermitian codes (Q491244) (← links)
- Selected unsolved problems in coding theory. (Q636050) (← links)
- Geometric and algebraic structures associated with the channel quantization problem (Q725850) (← links)
- Hermitian codes with automorphism group isomorphic to \(\operatorname{PGL}(2,q)\) with \(q\) odd (Q730366) (← links)
- Codes defined from some maximal curves (Q804543) (← links)
- Some optimal codes from algebraic geometry and their covering radii (Q918506) (← links)
- Artin-Schreier curves, exponential sums, and coding theory (Q1190478) (← links)
- On the dimension of Goppa codes (Q1205124) (← links)
- An improved Bombieri-Weil bound and applications to coding theory (Q1208155) (← links)
- Consecutive Weierstrass gaps and minimum distance of Goppa codes (Q1208228) (← links)
- Equality of geometric Goppa codes and equivalence of divisors (Q1313797) (← links)
- A class of generalized cyclic codes (Q1568233) (← links)
- The projective geometry of the Gale transform. (Q1583646) (← links)
- Equations for point configurations to Lie on a rational normal curve (Q1621468) (← links)
- A construction of some \([n,k,d;q]\)-codes meeting the Griesmer bound (Q1802135) (← links)
- Some applications of algorithms for constructing subspaces over a finite field (Q1812672) (← links)
- Further results on asymmetric authentication schemes (Q1854283) (← links)
- The theta divisor of a Jacobian variety and the decoding of geometric Goppa codes (Q1923536) (← links)
- Computing Riemann-Roch spaces via Puiseux expansions (Q2171940) (← links)
- Evaluation codes defined by finite families of plane valuations at infinity (Q2436567) (← links)
- A generalized floor bound for the minimum distance of geometric Goppa codes (Q2502925) (← links)
- Asymmetric code-theoretical schemes constructed with the use of algebraic geometric codes (Q2508767) (← links)
- Near-MDS codes arising from algebraic curves (Q2569922) (← links)
- On the evaluation codes given by simple \(\delta \)-sequences (Q2634585) (← links)
- (Q3476962) (← links)
- (Q3703791) (← links)
- Normal and abnormal codes (Q4307357) (← links)
- Redundancy estimates for the Lempel–Ziv algorithm of data compression (Q4936548) (← links)
- Algorithme de Brill-Noether et codes de Goppa (Q5752675) (← links)
- Algebraic complexities and algebraic curves over finite fields (Q5903919) (← links)
- Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities (Q6631548) (← links)
