The following pages link to Tom Høholdt (Q690666):
Displayed 50 items.
- Eigenvalues and expansion of bipartite graphs (Q690667) (← links)
- (Q1344097) (redirect page) (← links)
- A fast decoding method of AG codes from Miura-Kamiya curves \(C_{ab}\) up to half the Feng-Rao bound (Q1344098) (← links)
- A course in error-correcting codes. (Q1422079) (← links)
- Counting generalized Reed-Solomon codes (Q1691249) (← links)
- List decoding of matrix-product codes from nested codes: an application to quasi-cyclic codes (Q1760061) (← links)
- Optimal codes as Tanner codes with cyclic component codes (Q2350924) (← links)
- A course in error-correcting codes (Q2364843) (← links)
- On the sizes of expander graphs and minimum distances of graph codes (Q2449138) (← links)
- The Minimum Distance of Graph Codes (Q3005590) (← links)
- Maxentropic Markov chains (Corresp.) (Q3334738) (← links)
- The merit factor of binary sequences related to difference sets (Q3358646) (← links)
- A Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm (Q3540917) (← links)
- Codes from Expander Graphs (Q3540923) (← links)
- (Q3545360) (← links)
- Iterative List Decoding of Some LDPC Codes (Q3549074) (← links)
- (Q3613962) (← links)
- Optimal Bipartite Ramanujan Graphs from Balanced Incomplete Block Designs: Their Characterizations and Applications to Expander/LDPC Codes (Q3656810) (← links)
- (Q3694155) (← links)
- Aperiodic correlations and the merit factor of a class of binary sequences (Corresp.) (Q3726015) (← links)
- Determination of the merit factor of Legendre sequences (Q3797645) (← links)
- Double series representation of bounded signals (Q3804597) (← links)
- (Q3830943) (← links)
- (Q3922696) (← links)
- Fast decoding of codes from algebraic plane curves (Q3991394) (← links)
- (Q4177577) (← links)
- Determinants of a class of Toeplitz matrices. (Q4183854) (← links)
- On the number of correctable errors for some AG-codes (Q4202098) (← links)
- (Q4242017) (← links)
- A family of kummer extensions of the hermitian function field (Q4327593) (← links)
- An explicit construction of a sequence of codes attaining the Tsfasman-Vladut-Zink bound. The first steps (Q4336289) (← links)
- (Q4470465) (← links)
- (Q4474251) (← links)
- (Q4485875) (← links)
- (Q4489180) (← links)
- (Q4502634) (← links)
- Footprints or generalized Bezout's theorem (Q4503533) (← links)
- (Q4535942) (← links)
- Bounds on list decoding of MDS codes (Q4544597) (← links)
- Fast erasure-and-error decoding of algebraic geometry codes up to the Feng-Rao bound (Q4701127) (← links)
- Algebraic-geometry codes (Q4701204) (← links)
- Performance analysis of a decoding algorithm for algebraic-geometry codes (Q4701441) (← links)
- Construction and decoding of a class of algebraic geometry codes (Q4735143) (← links)
- Ternary sequences with perfect periodic autocorrelation (Corresp.) (Q4742688) (← links)
- On the decoding of algebraic-geometric codes (Q4880282) (← links)
- Fast decoding of algebraic-geometric codes up to the designed minimum distance (Q4880292) (← links)
- Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound (Q4880300) (← links)
- (Q4934416) (← links)
- Duals of Affine Grassmann Codes and Their Relatives (Q5271914) (← links)
- Affine Grassmann Codes (Q5281384) (← links)