| Publication | Date of Publication | Type |
|---|
New families of non-Reed-Solomon MDS codes
IEEE Transactions on Information Theory | 2026-03-18 | Paper |
Algebraic geometry codes for distributed matrix multiplication using local expansions
IEEE Transactions on Information Theory | 2026-03-18 | Paper |
Encoding and decoding of Reed-Muller codes with quasi-linear complexity
IEEE Transactions on Information Theory | 2026-03-18 | Paper |
| Efficient pseudorandom correlation generators over \(\mathbb{Z}/p^k\mathbb{Z} \) | 2026-02-04 | Paper |
| Polynomial commitments for Galois rings and applications to SNARKs over \(\mathbb{Z}_{2^k}\) | 2026-01-28 | Paper |
| Efficient pseudorandom correlation generators for any finite field | 2025-12-02 | Paper |
Coded distributed (batch) matrix multiplication over Galois ring via RMFE
IEEE Transactions on Information Theory | 2025-11-25 | Paper |
Degree-D reverse multiplication-friendly embeddings
IEEE Transactions on Information Theory | 2025-10-06 | Paper |
A new family of binary sequences with low correlation via elliptic curves
IEEE Transactions on Information Theory | 2025-10-06 | Paper |
Encoding of algebraic geometry codes with quasi-linear complexity O(N N)
IEEE Transactions on Information Theory | 2025-07-14 | Paper |
| Dishonest majority multiparty computation over matrix rings | 2025-07-03 | Paper |
| Interactive line-point zero-knowledge with sublinear communication and linear computation | 2025-07-03 | Paper |
| More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings | 2024-12-13 | Paper |
| Fast Fourier transform via automorphism groups of rational function fields | 2024-11-28 | Paper |
| List decoding of rank-metric codes with row-to-column ratio bigger than 1/2 | 2024-11-14 | Paper |
| On information-theoretic secure multiparty computation with local repairability | 2024-11-12 | Paper |
| Amortized NISC over \(\mathbb{Z}_{2^k}\) from RMFE | 2024-08-30 | Paper |
| Degree-\(D\) reverse multiplication-friendly embeddings: constructions and applications | 2024-08-30 | Paper |
| Ramp hyper-invertible matrices and their applications to MPC protocols | 2024-08-30 | Paper |
Explicit construction of \(q\)-ary 2-deletion correcting codes with low redundancy
IEEE Transactions on Information Theory | 2024-07-23 | Paper |
Binary sequences with a low correlation via cyclotomic function fields of odd characteristic
IEEE Transactions on Information Theory | 2024-07-22 | Paper |
Evolving secret sharing schemes based on polynomial evaluations and algebraic geometry codes
IEEE Transactions on Information Theory | 2024-07-22 | Paper |
A lower bound on the list-decodability of insdel codes
IEEE Transactions on Information Theory | 2024-07-21 | Paper |
A new construction of nonlinear codes via algebraic function fields
IEEE Transactions on Information Theory | 2024-07-19 | Paper |
Constructions of \(k\)-uniform states in heterogeneous systems
IEEE Transactions on Information Theory | 2024-07-19 | Paper |
| Nonlinear codes exceeding the Gilbert-Varshamov and Tsfasman-Vlăduţ-Zink bounds | 2024-05-14 | Paper |
Maximally Recoverable Local Repairable Codes From Subspace Direct Sum Systems
IEEE Transactions on Information Theory | 2024-03-19 | Paper |
Bounds and Constructions for Insertion and Deletion Codes
IEEE Transactions on Information Theory | 2024-03-18 | Paper |
Leakage-Resilient Secret Sharing With Constant Share Size
IEEE Transactions on Information Theory | 2024-03-14 | Paper |
| scientific article; zbMATH DE number 7788341 (Why is no real title available?) | 2024-01-15 | Paper |
Beating the probabilistic lower bound on \(q\)-perfect hashing
Combinatorica | 2023-10-04 | Paper |
More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
Advances in Cryptology – CRYPTO 2022 | 2023-06-12 | Paper |
Improved single-round secure multiplication using regenerating codes
Lecture Notes in Computer Science | 2023-05-12 | Paper |
| Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) | 2023-03-29 | Paper |
The group structures of automorphism groups of elliptic curves over finite fields and their applications to optimal locally repairable codes
Journal of Combinatorial Theory. Series A | 2022-10-14 | Paper |
| scientific article; zbMATH DE number 7579810 (Why is no real title available?) | 2022-09-01 | Paper |
| scientific article; zbMATH DE number 7561561 (Why is no real title available?) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561591 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Construction of Optimal (<i>r</i>, δ)-Locally Recoverable Codes and Connection With Graph Theory
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
Binary Sequences With a Low Correlation via Cyclotomic Function Fields
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
A new framework for deniable secure key exchange
Information and Computation | 2022-06-08 | Paper |
| Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC | 2022-04-22 | Paper |
Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes
Journal of the ACM | 2022-03-31 | Paper |
| On the complexity of arithmetic secret sharing | 2022-03-23 | Paper |
| scientific article; zbMATH DE number 7492075 (Why is no real title available?) | 2022-03-17 | Paper |
Communication Efficient Secret Sharing With Small Share Size
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
| Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes | 2021-12-01 | Paper |
Lossless dimension expanders via linearized polynomials and subspace designs
Combinatorica | 2021-10-25 | Paper |
| A survey on locally repairable codes | 2021-09-29 | Paper |
Efficiently List-Decodable Insertion and Deletion Codes via Concatenation
IEEE Transactions on Information Theory | 2021-09-07 | Paper |
| scientific article; zbMATH DE number 7378653 (Why is no real title available?) | 2021-08-04 | Paper |
Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime
IEEE Transactions on Information Theory | 2021-07-22 | Paper |
| An improvement of the Hasse-Weil bound for Artin-Schreier curves via cyclotomic function fields | 2021-05-10 | Paper |
A New Construction of Nonlinear Codes via Rational Function Fields
IEEE Transactions on Information Theory | 2021-02-24 | Paper |
Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields
IEEE Transactions on Information Theory | 2020-12-04 | Paper |
Constructive Asymptotic Bounds of Locally Repairable Codes via Function Fields
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
On the Bounded Distance Decoding Problem for Lattices Constructed and Their Cryptographic Applications
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
A Construction of Optimal Frequency Hopping Sequence Set via Combination of Multiplicative and Additive Groups of Finite Fields
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
| scientific article; zbMATH DE number 7250144 (Why is no real title available?) | 2020-09-22 | Paper |
| The group structures of automorphism groups of elliptic function fields over finite fields and their applications to optimal locally repairable codes | 2020-08-26 | Paper |
| Amortized complexity of information-theoretically secure MPC revisited | 2020-06-30 | Paper |
| Subspace designs based on algebraic function fields | 2020-05-27 | Paper |
| Reducing the key size of McEliece cryptosystem from automorphism-induced Goppa codes via permutations | 2020-01-28 | Paper |
Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
New Extension Constructions of Optimal Frequency-Hopping Sequence Sets
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Asymptotic Gilbert–Varshamov Bound on Frequency Hopping Sequences
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Construction of Asymptotically Good Locally Repairable Codes via Automorphism Groups of Function Fields
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
List Decodability of Symbol-Pair Codes
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
How Long Can Optimal Locally Repairable Codes Be?
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
The asymptotic behavior of automorphism groups of function fields over finite fields
Transactions of the American Mathematical Society | 2019-07-03 | Paper |
Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets (extended abstract)
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
IEEE Transactions on Information Theory | 2019-01-28 | Paper |
On subfields of the Hermitian function field involving the involution automorphism
Journal of Number Theory | 2019-01-23 | Paper |
On subfields of the Hermitian function field involving the involution automorphism
Journal of Number Theory | 2019-01-23 | Paper |
Optimal Locally Repairable Codes Via Elliptic Curves
IEEE Transactions on Information Theory | 2019-01-18 | Paper |
Construction of optimal locally recoverable codes and connection with hypergraph
(available as arXiv preprint) | 2018-11-22 | Paper |
Subspace designs based on algebraic function fields
Transactions of the American Mathematical Society | 2018-10-18 | Paper |
Subspace designs based on algebraic function fields
Transactions of the American Mathematical Society | 2018-10-18 | Paper |
| \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority | 2018-09-26 | Paper |
Algebraic Geometry Codes With Complementary Duals Exceed the Asymptotic Gilbert-Varshamov Bound
IEEE Transactions on Information Theory | 2018-09-19 | Paper |
A New Class of Rank-Metric Codes and Their List Decoding Beyond the Unique Decoding Radius
IEEE Transactions on Information Theory | 2018-09-14 | Paper |
Construction of Sequences With High Nonlinear Complexity From Function Fields
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Repairing Algebraic Geometry Codes
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
List Decoding of Cover Metric Codes Up to the Singleton Bound
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
| Linear-time non-malleable codes in the bit-wise independent tampering model | 2018-03-16 | Paper |
Multipartite entangled states, symmetric matrices and error-correcting codes
IEEE Transactions on Information Theory | 2017-11-10 | Paper |
Efficiently List-Decodable Punctured Reed-Muller Codes
IEEE Transactions on Information Theory | 2017-09-21 | Paper |
Multisequences With Large Linear and $k$-Error Linear Complexity From Hermitian Function Fields
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Optimal rate list decoding over bounded alphabets using algebraic-geometric codes
(available as arXiv preprint) | 2017-08-03 | Paper |
Asymmetric Quantum Codes: Characterization and Constructions
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
On Self-Dual Cyclic Codes Over Finite Fields
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Application of Classical Hermitian Self-Orthogonal MDS Codes to Quantum MDS Codes
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Generalization of Steane's Enlargement Construction of Quantum Codes and Applications
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
New MDS Self-Dual Codes From Generalized Reed—Solomon Codes
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
New Constant-Weight Codes From Propagation Rules
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Asymptotically Good Nonlinear Codes From Algebraic Curves
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Amortized complexity of zero-knowledge proofs revisited: achieving linear soundness slack
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Euclidean and Hermitian Self-Orthogonal Algebraic Geometry Codes and Their Application to Quantum Codes
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
An Upper Bound on the Complexity of Multiplication of Polynomials Modulo a Power of an Irreducible Polynomial
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Bounds on the Threshold Gap in Secret Sharing and its Applications
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Sequences With High Nonlinear Complexity
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
A Construction of New Quantum MDS Codes
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Natural Generalizations of Threshold Secret Sharing
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Erasure List-Decodable Codes From Random and Algebraic Geometry Codes
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Torsion limits and Riemann-Roch systems for function fields and applications
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
List Decodability of Random Subcodes of Gabidulin Codes
IEEE Transactions on Information Theory | 2017-05-02 | Paper |
New Binary Codes From Rational Function Fields
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
On the List-Decodability of Random Self-Orthogonal Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
An improvement to the Hasse-Weil bound and applications to character sums, cryptography and coding
Advances in Mathematics | 2017-02-17 | Paper |
Constructions of block codes from algebraic curves over finite fields
Surveys in Combinatorics 2015 | 2016-12-20 | Paper |
On automorphism groups of cyclotomic function fields over finite fields
Journal of Number Theory | 2016-08-18 | Paper |
Some highlights of Harald Niederreiter's work
(available as arXiv preprint) | 2016-06-10 | Paper |
On secret sharing with nonlinear product reconstruction
SIAM Journal on Discrete Mathematics | 2015-07-21 | Paper |
Optimal algebraic manipulation detection codes in the constant-error model
Theory of Cryptography | 2015-07-06 | Paper |
Towards a characterization of subfields of the Deligne-Lusztig function fields
Journal of Combinatorial Theory. Series A | 2015-06-19 | Paper |
Optimal rate algebraic list decoding using narrow ray class fields
Journal of Combinatorial Theory. Series A | 2014-11-19 | Paper |
A relation between embedding degrees and class numbers of binary quadratic forms
Mathematics of Computation | 2014-09-10 | Paper |
List decoding Reed-Solomon, algebraic-geometric, and Gabidulin subcodes up to the Singleton bound
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Folded codes from function field towers and improved optimal rate list decoding
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
New results on two hypercube coloring problems
Discrete Applied Mathematics | 2014-04-23 | Paper |
On the representability of the biuniform matroid
SIAM Journal on Discrete Mathematics | 2014-01-21 | Paper |
On the representability of the biuniform matroid
SIAM Journal on Discrete Mathematics | 2014-01-21 | Paper |
Algebraic curves in cryptography
Discrete Mathematics and its Applications | 2013-07-15 | Paper |
Constructing irreducible polynomials over finite fields
Mathematics of Computation | 2012-06-29 | Paper |
Natural generalizations of threshold secret sharing
Lecture Notes in Computer Science | 2011-12-02 | Paper |
Structure of functional codes defined on non-degenerate Hermitian varieties
Journal of Combinatorial Theory. Series A | 2011-10-21 | Paper |
The torsion-limit for algebraic function fields and its application to arithmetic secret sharing
Lecture Notes in Computer Science | 2011-08-12 | Paper |
A Gilbert-Varshamov-type bound for lattice packings
Journal of Combinatorial Theory. Series A | 2011-04-11 | Paper |
A Gilbert-Varshamov type bound for Euclidean packings
Mathematics of Computation | 2010-11-07 | Paper |
Key predistribution schemes and one-time broadcast encryption schemes from algebraic geometry codes
Cryptography and Coding | 2010-01-07 | Paper |
| Algebraic geometry in coding theory and cryptography | 2009-10-28 | Paper |
Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
A constructive bound on kissing numbers
Proceedings of the American Mathematical Society | 2009-09-11 | Paper |
| New informations on the structure of the functional codes defined by forms of degree $h$ on non-degenerate Hermitian varieties in $\mathbb{P}^{n(\mathbb{F}_q)$} | 2009-07-27 | Paper |
| Intersection of two quadrics with no common hyperplane in $\mathbb{P}^{n}(\mathbb{F}_q)$}} | 2009-07-27 | Paper |
Construction of global function fields from linear codes and vice versa
Transactions of the American Mathematical Society | 2009-03-30 | Paper |
Access Structures of Elliptic Secret Sharing Schemes
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
A Class of Polynomial Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Polyadic Codes Revisited
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Asymptotic bounds on quantum codes from algebraic geometry codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Quantum Codes From Concatenated Algebraic-Geometric Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
New lower bounds and constructions for binary codes correcting asymmetric errors
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Disjoint Linear Codes From Algebraic Function Fields
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Excellent Nonlinear Codes From Algebraic Function Fields
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Goppa geometric codes achieving the Gilbert-Varshamov bound
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
A Construction of Binary Constant-Weight Codes From Algebraic Curves Over Finite Fields
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Diagonal Lattice Space–Time Codes From Number Fields and Asymptotic Bounds
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
New Linear Codes and Algebraic Function Fields Over Finite Fields
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Linear Codes From Narrow Ray Class Groups of Algebraic Curves
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
A $2\times 2$ lattice space-time code of rank $5$
Proceedings of the American Mathematical Society | 2008-10-24 | Paper |
Dense packings from quadratic fields and codes
Journal of Combinatorial Theory. Series A | 2008-09-04 | Paper |
Function-field codes
Applicable Algebra in Engineering, Communication and Computing | 2008-08-20 | Paper |
Packing superballs from codes and algebraic curves
Acta Mathematica Sinica, English Series | 2008-06-11 | Paper |
A new construction of quantum error-correcting codes
Transactions of the American Mathematical Society | 2008-01-21 | Paper |
| Function fields over finite fields and their applications to cryptography | 2007-07-18 | Paper |
Algebraic curves with many points over the binary field
Journal of Algebra | 2007-06-22 | Paper |
Zeta-functions of curves of genus 2 over finite fields
Journal of Algebra | 2007-04-18 | Paper |
An explicit class of codes with good parameters and their duals
Discrete Applied Mathematics | 2006-04-28 | Paper |
Selected Areas in Cryptography
Lecture Notes in Computer Science | 2005-12-27 | Paper |
CODES FOR KEY GENERATION IN QUANTUM CRYPTOGRAPHY
International Journal of Quantum Information | 2005-12-09 | Paper |
Linear authentication codes: bounds and constructions
IEEE Transactions on Information Theory | 2005-06-01 | Paper |
Low-correlation, large linear span sequences from function fields
IEEE Transactions on Information Theory | 2005-06-01 | Paper |
Asymptotic bounds on frameproof codes
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
Constructions of codes from residue rings of polynomials
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
The minimum distance of the duals of binary irreducible cyclic codes
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
On the variance of average distance of subsets in the Hamming space
Discrete Applied Mathematics | 2005-02-23 | Paper |
| scientific article; zbMATH DE number 2127868 (Why is no real title available?) | 2005-01-14 | Paper |
| scientific article; zbMATH DE number 2101582 (Why is no real title available?) | 2004-09-22 | Paper |
A short biography of Harald Niederreiter (On the occasion of his 60th birthday)
Journal of Complexity | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2051213 (Why is no real title available?) | 2004-03-07 | Paper |
| scientific article; zbMATH DE number 1996493 (Why is no real title available?) | 2003-10-22 | Paper |
Symmetric polynomials and some good codes
Finite Fields and their Applications | 2003-09-30 | Paper |
| scientific article; zbMATH DE number 1972833 (Why is no real title available?) | 2003-08-31 | Paper |
Explicit constructions of perfect hash families from algebraic curves over finite fields
Journal of Combinatorial Theory. Series A | 2003-08-05 | Paper |
| scientific article; zbMATH DE number 1944666 (Why is no real title available?) | 2003-07-01 | Paper |
Several classes of \((2^{m}-1,w,2)\) optical orthogonal codes
Discrete Applied Mathematics | 2003-06-10 | Paper |
| scientific article; zbMATH DE number 1857521 (Why is no real title available?) | 2003-05-19 | Paper |
| scientific article; zbMATH DE number 1504557 (Why is no real title available?) | 2003-01-16 | Paper |
Some computational problems of cryptographic significance concerning elliptic curves over rings
Information and Computation | 2003-01-14 | Paper |
Multisequences with almost perfect linear complexity profile and function fields over finite fields
Journal of Complexity | 2002-10-20 | Paper |
Improvements on parameters of one-point AG codes from Hermitian curves
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vladut-Zink bounds
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
New binary linear codes from algebraic curves
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
| scientific article; zbMATH DE number 1532366 (Why is no real title available?) | 2002-06-11 | Paper |
| scientific article; zbMATH DE number 1740049 (Why is no real title available?) | 2002-05-14 | Paper |
Drinfeld modules of rank 1 and algebraic curves with many rational points
Monatshefte für Mathematik | 2002-04-16 | Paper |
Constructions of digital nets
Acta Arithmetica | 2002-03-20 | Paper |
| scientific article; zbMATH DE number 1594314 (Why is no real title available?) | 2001-10-31 | Paper |
| \((2^m-1,w,2)\) optical orthogonal codes with \(w=11\) and \(13\) | 2001-10-14 | Paper |
| scientific article; zbMATH DE number 1588473 (Why is no real title available?) | 2001-07-17 | Paper |
Rational points on curves over finite fields. Theory and Applications
London Mathematical Society Lecture Note Series | 2001-06-07 | Paper |
A class of linear codes with good parameters
IEEE Transactions on Information Theory | 2001-03-19 | Paper |
Some new codes from algebraic curves
IEEE Transactions on Information Theory | 2001-03-19 | Paper |
| scientific article; zbMATH DE number 1222353 (Why is no real title available?) | 2001-03-04 | Paper |
A class of linear codes with good parameters from algebraic curves
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
A generalization of algebraic-geometry codes
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
Constructions of authentication codes from algebraic curves over finite fields
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
Constructions of sequences with almost perfect linear complexity profile from curves over finite fields
Finite Fields and their Applications | 2000-09-06 | Paper |
A counterexample to Perret's conjecture on infinite class field towers for global function fields
Finite Fields and their Applications | 2000-09-04 | Paper |
A propagation rule for linear codes
Applicable Algebra in Engineering, Communication and Computing | 2000-08-08 | Paper |
scientific article; zbMATH DE number 1422907 (Why is no real title available?)
Compositio Mathematica | 2000-06-04 | Paper |
| scientific article; zbMATH DE number 1408406 (Why is no real title available?) | 2000-05-29 | Paper |
| scientific article; zbMATH DE number 953226 (Why is no real title available?) | 2000-03-19 | Paper |
Constructions of algebraic-geometry codes
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Sequences with almost perfect linear complexity profiles and curves over finite fields
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Global function fields with many rational places over the quinary field. II
Acta Arithmetica | 1999-10-17 | Paper |
| scientific article; zbMATH DE number 1305301 (Why is no real title available?) | 1999-10-06 | Paper |
| scientific article; zbMATH DE number 1339967 (Why is no real title available?) | 1999-09-22 | Paper |
| scientific article; zbMATH DE number 1182977 (Why is no real title available?) | 1999-08-23 | Paper |
| scientific article; zbMATH DE number 1246223 (Why is no real title available?) | 1999-06-28 | Paper |
Towers of Global Function Fields with Asymptotically Many Rational Places and an Improvement on the Gilbert - Varshamov Bound
Mathematische Nachrichten | 1999-03-23 | Paper |
| scientific article; zbMATH DE number 1186972 (Why is no real title available?) | 1999-03-22 | Paper |
GLOBAL FUNCTION FIELDS WITH MANY RATIONAL PLACES OVER THE QUINARY FIELD
Demonstratio Mathematica | 1999-02-08 | Paper |
A new construction of algebraic-geometry codes
Applicable Algebra in Engineering, Communication and Computing | 1999-01-01 | Paper |
Low-discrepancy sequences and global function fields with many rational places
Finite Fields and their Applications | 1998-04-26 | Paper |
On supersingular abelian varieties of dimension two over finite fields
Finite Fields and their Applications | 1998-04-26 | Paper |
Global function fields with many rational places over the ternary field
Acta Arithmetica | 1998-04-20 | Paper |
| scientific article; zbMATH DE number 1103065 (Why is no real title available?) | 1998-04-01 | Paper |
Drinfeld modules of rank 1 and algebraic curves with many rational points. II
Acta Arithmetica | 1997-07-30 | Paper |
Cyclotomic function fields, Hilbert class fields, and global function fields with many rational places
Acta Arithmetica | 1997-04-23 | Paper |
Automorphism group of elliptic codes
Communications in Algebra | 1997-02-04 | Paper |
On the structure of the divisor class group of a class of curves over finite fields
Archiv der Mathematik | 1996-10-29 | Paper |
Explicit global function fields over the binary field with many rational places
Acta Arithmetica | 1996-10-29 | Paper |
| scientific article; zbMATH DE number 878609 (Why is no real title available?) | 1996-08-05 | Paper |
On automorphism groups of the Hermitian codes
IEEE Transactions on Information Theory | 1996-06-04 | Paper |
A construction of low-discrepancy sequences using global function fields
Acta Arithmetica | 1996-05-19 | Paper |
| scientific article; zbMATH DE number 700517 (Why is no real title available?) | 1996-05-09 | Paper |
| scientific article; zbMATH DE number 713432 (Why is no real title available?) | 1996-04-01 | Paper |
Low-discrepancy sequences obtained from algebraic function fields over finite fields
Acta Arithmetica | 1996-03-07 | Paper |
The structure of the rational point groups of simple abelian varieties of dimension two over finite fields
Archiv der Mathematik | 1995-05-30 | Paper |
The characteristic polynomials of abelian varieties of dimensions three and four over finite fields
Science in China. Series A | 1995-05-02 | Paper |
The genus of maximal function fields over finite fields
Manuscripta Mathematica | 1995-03-13 | Paper |
| scientific article; zbMATH DE number 468926 (Why is no real title available?) | 1994-01-10 | Paper |
| scientific article; zbMATH DE number 169435 (Why is no real title available?) | 1993-05-16 | Paper |
Multiple Kummer extension and the number of prime divisors of degree one in function fields
Journal of Pure and Applied Algebra | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 123818 (Why is no real title available?) | 1993-02-18 | Paper |
A note on the minimum distance of Hermitian codes
Chinese Science Bulletin | 1993-01-17 | Paper |
When are two geometric Goppa codes equal?
IEEE Transactions on Information Theory | 1992-09-27 | Paper |
On the decoding of algebraic-geometric codes
Chinese Science Bulletin | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 27268 (Why is no real title available?) | 1992-06-27 | Paper |
| scientific article; zbMATH DE number 25605 (Why is no real title available?) | 1992-06-27 | Paper |
Hyperelliptic function fields and codes
Journal of Pure and Applied Algebra | 1992-06-27 | Paper |
Quadratic function fields and codes
Chinese Science Bulletin | 1992-06-26 | Paper |
Remarks on self-dual elliptic codes
Chinese Science Bulletin | 1992-06-26 | Paper |
Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric
(available as arXiv preprint) | N/A | Paper |
