Chaoping Xing

Matthieu Rambaud

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020

Asymptotic Gilbert-Varshamov Bound on Frequency Hopping Sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

A Construction of Optimal Frequency Hopping Sequence Set via Combination of Multiplicative and Additive Groups of Finite Fields.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Constructive Asymptotic Bounds of Locally Repairable Codes via Function Fields.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

On the Bounded Distance Decoding Problem for Lattices Constructed and Their Cryptographic Applications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

A New Code Based Signature Scheme without Trapdoors.

[BibT_eX]

[DOI]

Zhe Li

IACR Cryptol. ePrint Arch., 2020

Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/p^k Z.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

A Secure Federated Transfer Learning Framework.

[BibT_eX]

[DOI]

IEEE Intell. Syst., 2020

Secure Weighted Aggregation in Federated Learning.

[BibT_eX]

[DOI]

CoRR, 2020

The group structures of automorphism groups of elliptic function fields over finite fields and their applications to optimal locally repairable codes.

[BibT_eX]

[DOI]

CoRR, 2020

MPC-enabled Privacy-Preserving Neural Network Training against Malicious Attack.

[BibT_eX]

[DOI]

CoRR, 2020

Symmetric uncoded caching schemes with low subpacketization levels.

[BibT_eX]

[DOI]

Tai Do Duc

Shuo Shao

CoRR, 2020

Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $\mathbb {Z}/p^k\mathbb {Z} $.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019

New Extension Constructions of Optimal Frequency-Hopping Sequence Sets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

List Decodability of Symbol-Pair Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Construction of Asymptotically Good Locally Repairable Codes via Automorphism Groups of Function Fields.

[BibT_eX]

[DOI]

Xudong Li

IEEE Trans. Inf. Theory, 2019

Optimal Locally Repairable Codes Via Elliptic Curves.

[BibT_eX]

[DOI]

Xudong Li

IEEE Trans. Inf. Theory, 2019

How Long Can Optimal Locally Repairable Codes Be?

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

On the Complexity of Arithmetic Secret Sharing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Blackbox Secret Sharing Revisited: A Coding-Theoretic Approach with Application to Expansionless Near-Threshold Schemes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Asymptotically-Good Arithmetic Secret Sharing over Z/(p^\ell Z) with Strong Multiplication and Its Applications to Efficient MPC.

[BibT_eX]

[DOI]

Matthieu Rambaud

IACR Cryptol. ePrint Arch., 2019

A note on short invertible ring elements and applications to cyclotomic and trinomials number fields.

[BibT_eX]

[DOI]

Thomas Attema

IACR Cryptol. ePrint Arch., 2019

Beating the probabilistic lower bound on perfect hashing.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2019

Optimal repairing schemes for Reed-Solomon codes with alphabet sizes linear in lengths under the rack-aware model.

[BibT_eX]

[DOI]

Gaojun Luo

CoRR, 2019

Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime.

[BibT_eX]

[DOI]

Ivan Tjuawinata

CoRR, 2019

On List Decoding of Insertion and Deletion Errors.

[BibT_eX]

[DOI]

Ivan Tjuawinata

CoRR, 2019

Reducing the Key Size of McEliece Cryptosystem from Automorphism-induced Goppa Codes via Permutations.

[BibT_eX]

[DOI]

Zhe Li

Proceedings of the Public-Key Cryptography - PKC 2019, 2019

Construction of Optimal Locally Recoverable Codes and Connection with Hypergraph.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Secure and Efficient Federated Transfer Learning.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE International Conference on Big Data (IEEE BigData), 2019

2018

List Decoding of Cover Metric Codes Up to the Singleton Bound.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Algebraic Geometry Codes With Complementary Duals Exceed the Asymptotic Gilbert-Varshamov Bound.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Repairing Algebraic Geometry Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Reducing the Key Size of McEliece Cryptosystem from Goppa Codes via Permutations.

[BibT_eX]

[DOI]

Zhe Li

IACR Cryptol. ePrint Arch., 2018

SPDℤ2k: Efficient MPC mod 2k for Dishonest Majority.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Amortized Complexity of Information-Theoretically Secure MPC Revisited.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

A Construction of Optimal Frequency Hopping Sequence Set via Combination of Multiplicative and Additive Groups of Finite Fields.

[BibT_eX]

[DOI]

CoRR, 2018

Asymptotic Gilbert-Varshamov bound on Frequency Hopping.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Construction of Sequences With High Nonlinear Complexity From Function Fields.

[BibT_eX]

[DOI]

Lin You

IEEE Trans. Inf. Theory, 2017

List Decodability of Random Subcodes of Gabidulin Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

New MDS Self-Dual Codes From Generalized Reed - Solomon Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Efficiently List-Decodable Punctured Reed-Muller Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Multipartite Entangled States, Symmetric Matrices, and Error-Correcting Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

On the Closest Vector Problem for Lattices Constructed from Polynomials and Their Cryptographic Applications.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Subspace Designs based on Algebraic Function Fields.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2017

Efficiently repairing algebraic geometry codes.

[BibT_eX]

[DOI]

CoRR, 2017

Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

2016

Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs.

[BibT_eX]

[DOI]

Carol Wang

IEEE Trans. Inf. Theory, 2016

Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

On Multi-Point Local Decoding of Reed-Muller Codes.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2016

2015

On the List-Decodability of Random Self-Orthogonal Codes.

[BibT_eX]

[DOI]

Xiande Zhang

IEEE Trans. Inf. Theory, 2015

New Binary Codes From Rational Function Fields.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

On Secret Sharing with Nonlinear Product Reconstruction.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Optimal rate algebraic list decoding using narrow ray class fields.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2015

A new class of rank-metric codes and their list decoding beyond the unique decoding radius.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2015

Efficient list decoding of punctured Reed-Muller codes.

[BibT_eX]

[DOI]

CoRR, 2015

An Improvement on the Hasse-Weil Bound and applications to Character Sums, Cryptography and Coding.

[BibT_eX]

[DOI]

CoRR, 2015

Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model.

[BibT_eX]

[DOI]

Carles Padró

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Constructions of block codes from algebraic curves over finite fields.

[BibT_eX]

[DOI]

Proceedings of the Surveys in Combinatorics 2015, 2015

2014

Sequences With High Nonlinear Complexity.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

A Construction of New Quantum MDS Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Natural Generalizations of Threshold Secret Sharing.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Erasure List-Decodable Codes From Random and Algebraic Geometry Codes.

[BibT_eX]

[DOI]

Yang Ding

IEEE Trans. Inf. Theory, 2014

Torsion Limits and Riemann-Roch Systems for Function Fields and Applications.

[BibT_eX]

[DOI]

Ignacio Cascudo

IEEE Trans. Inf. Theory, 2014

Private Searching on Streaming Data Based on Keyword Frequency.

[BibT_eX]

[DOI]

IEEE Trans. Dependable Secur. Comput., 2014

A relation between embedding degrees and class numbers of binary quadratic forms.

[BibT_eX]

[DOI]

Enver Ozdemir

Math. Comput., 2014

Optimal Algebraic Manipulation Detection Codes.

[BibT_eX]

[DOI]

Carles Padró

IACR Cryptol. ePrint Arch., 2014

Correcting on curves and highly sound locally correctable codes of high rate.

[BibT_eX]

[DOI]

Yeow Meng Chee

Liyasi Wu

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Some highlights of Harald Niederreiter's work.

[BibT_eX]

[DOI]

Gerhard Larcher

Friedrich Pillichshammer

Arne Winterhof

Proceedings of the Applied Algebra and Number Theory, 2014

2013

Bounds on the Threshold Gap in Secret Sharing and its Applications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

An Upper Bound on the Complexity of Multiplication of Polynomials Modulo a Power of an Irreducible Polynomial.

[BibT_eX]

[DOI]

Michael Kaminski

IEEE Trans. Inf. Theory, 2013

On the Representability of the Biuniform Matroid.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Towards a characterization of subfields of the Deligne-Lusztig function fields.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2013

Hitting Sets for Low-Degree Polynomials with Optimal Density.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2013

Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2013

New results on two hypercube coloring problems.

[BibT_eX]

[DOI]

Fang-Wei Fu

Discret. Appl. Math., 2013

2012

Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields.

[BibT_eX]

[DOI]

An Yang

IEEE Trans. Inf. Theory, 2012

Euclidean and Hermitian Self-Orthogonal Algebraic Geometry Codes and Their Application to Quantum Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Good Linear Codes from Polynomial Evaluations.

[BibT_eX]

[DOI]

Yang Ding

IEEE Trans. Commun., 2012

Constructing irreducible polynomials over finite fields.

[BibT_eX]

[DOI]

Enver Ozdemir

Math. Comput., 2012

The Arithmetic Codex.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Bounds on the Threshold Gap in Secret Sharing over Small Fields.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

List decoding Reed-Solomon, Algebraic-Geometric, and Gabidulin subcodes up to the Singleton bound.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2012

Folded Codes from Function Field Towers and Improved Optimal Rate List Decoding.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2012

Cumulative Distance Enumerators of Random Codes and their Thresholds

[BibT_eX]

[DOI]

CoRR, 2012

Private (t, n) Threshold Searching on Streaming Data.

[BibT_eX]

[DOI]

Xun Yi

Proceedings of the 2012 International Conference on Privacy, 2012

A construction of quantum codes via a class of classical polynomial codes.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

Asymptotically Good Nonlinear Codes From Algebraic Curves.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

On Self-Dual Cyclic Codes Over Finite Fields.

[BibT_eX]

[DOI]

Yan Jia

IEEE Trans. Inf. Theory, 2011

A Gilbert-Varshamov-type bound for lattice packings.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2011

Structure of functional codes defined on non-degenerate Hermitian varieties.

[BibT_eX]

[DOI]

Frédéric A. B. Edoukou

J. Comb. Theory, Ser. A, 2011

Quantum Gilbert-Varshamov bound through symplectic self-orthogonal codes.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2010

Asymmetric quantum codes: characterization and constructions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Generalization of Steane's enlargement construction of quantum codes and applications.

[BibT_eX]

[DOI]

Jinquan Luo

IEEE Trans. Inf. Theory, 2010

Application of classical hermitian self-orthogonal MDS codes to quantum MDS codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

New constant-weight codes from propagation rules.

[BibT_eX]

[DOI]

Yeow Meng Chee

IEEE Trans. Inf. Theory, 2010

2009

Multisequences with large linear and k-error linear complexity from Hermitian function fields.

[BibT_eX]

[DOI]

Yang Ding

IEEE Trans. Inf. Theory, 2009

Cyclic Codes and Sequences from Kasami-Welch Functions

[BibT_eX]

[DOI]

Jinquan Luo

CoRR, 2009

Cyclic Codes and Sequences from a Class of Dembowski-Ostrom Functions

[BibT_eX]

[DOI]

Jinquan Luo

CoRR, 2009

Key Predistribution Schemes and One-Time Broadcast Encryption Schemes from Algebraic Geometry Codes.

[BibT_eX]

[DOI]

Proceedings of the Cryptography and Coding, 2009

Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

2008

Access Structures of Elliptic Secret Sharing Schemes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

A Gilbert-Varshamov type bound for Euclidean packings.

[BibT_eX]

[DOI]

Gabriele Nebe

Math. Comput., 2008

Dense packings from quadratic fields and codes.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2008

Function-field codes.

[BibT_eX]

[DOI]

Dirk Hachenberger

Appl. Algebra Eng. Commun. Comput., 2008

2007

New Linear Codes and Algebraic Function Fields Over Finite Fields.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

Diagonal Lattice Space-Time Codes From Number Fields and Asymptotic Bounds.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

2006

Asymptotic bounds on quantum codes from algebraic geometry codes.

[BibT_eX]

[DOI]

Keqin Feng

IEEE Trans. Inf. Theory, 2006

Special issue on algebra and coding theory.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2006

An explicit class of codes with good parameters and their duals.

[BibT_eX]

[DOI]

Ferruh Özbudak

Discret. Appl. Math., 2006

2005

A construction of binary constant-weight codes from algebraic curves over finite fields.

[BibT_eX]

[DOI]

Jie Ling

IEEE Trans. Inf. Theory, 2005

Goppa geometric codes achieving the Gilbert-Varshamov bound.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

Excellent nonlinear codes from algebraic function fields.

[BibT_eX]

[DOI]

Henning Stichtenoth

IEEE Trans. Inf. Theory, 2005

Quantum codes from concatenated algebraic-geometric codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

On the variance of average distance of subsets in the Hamming space.

[BibT_eX]

[DOI]

Fang-Wei Fu

Discret. Appl. Math., 2005

2004

A class of polynomial codes.

[BibT_eX]

[DOI]

Yang Fang

IEEE Trans. Inf. Theory, 2004

Linear codes from narrow ray class groups of algebraic curves.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Disjoint Linear Codes From Algebraic Function Fields.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Polyadic codes revisited.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Cyclotomic Optical Orthogonal Codes of Composite Lengths.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2004

A short biography of Harald Niederreiter.

[BibT_eX]

[DOI]

J. Complex., 2004

Special issue on cryptography and coding theory.

[BibT_eX]

[DOI]

J. Complex., 2004

2003

Low-correlation, large linear span sequences from function fields.

[BibT_eX]

[DOI]

P. Vijay Kumar

IEEE Trans. Inf. Theory, 2003

Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

Linear authentication codes: bounds and constructions.

[BibT_eX]

[DOI]

Reihaneh Safavi-Naini

IEEE Trans. Inf. Theory, 2003

New lower bounds and constructions for binary codes correcting asymmetric errors.

[BibT_eX]

[DOI]

Fang-Wei Fu

IEEE Trans. Inf. Theory, 2003

Multiple-Time Signature Schemes against Adaptive Chosen Message Attacks.

[BibT_eX]

[DOI]

Josef Pieprzyk

Proceedings of the Selected Areas in Cryptography, 10th Annual International Workshop, 2003

2002

Improvements on parameters of one-point AG Codes from Hermitian curves.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

Constructions of codes from residue rings of polynomials.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

Asymptotic bounds on frameproof codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

New binary linear codes from algebraic curves.

[BibT_eX]

[DOI]

Ka Hin Leung

IEEE Trans. Inf. Theory, 2002

The minimum distance of the duals of binary irreducible cyclic codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

2001

Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vladut-Zink bounds.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

Explicit Constructions of Perfect Hash Families from Algebraic Curves over Finite Fields.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2001

Several Classes of (2m - 1, w, 2) Optical Orthogonal Codes.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Constructions of Sequences from Algebraic Curves over Finite Fields.

[BibT_eX]

[DOI]

Proceedings of the Sequences and their Applications, 2001

2000

Constructions of authentication codes from algebraic curves over finite fields.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

A class of linear codes with good parameters.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

A class of linear codes with good parameters from algebraic curves.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

Some new codes from algebraic curves.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

Multi-sequences with Almost Perfect Linear Complexity Profile and Function Fields over Finite Fields.

[BibT_eX]

[DOI]

J. Complex., 2000

A Propagation Rule for Linear Codes.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2000

1999

A generalization of algebraic-geometry codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

Constructions of Algebraic-Geometry Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

Sequences with Almost Perfect Linear Complexity Profiles and Curves Over Finite Fields.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

Some Computational Problems of Cryptographic Significance Concerning Elliptic Curves over Rings.

[BibT_eX]

[DOI]

Ming-Deh A. Huang

Inf. Comput., 1999

Construction and Enumeration of All Binary Duadic Codes of Length pm.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1999

A New Construction of Algebraic Geometry Codes.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1999

A Class of Explicit Perfect Multi-sequences.

[BibT_eX]

[DOI]

Zhenghong Wei

Proceedings of the Advances in Cryptology, 1999

1998

Explicit Sequence Expansions.

[BibT_eX]

[DOI]

David R. Kohel

Proceedings of the Sequences and their Applications, 1998

A General Method of Constructing Global Function Fields.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Number Theory, Third International Symposium, 1998

1995

On Automorphism Groups of the Hermitian Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

1992

When are two geometric Goppa codes equal?

[BibT_eX]

[DOI]