A method of constructing linear mapping families to achieve the asymptotic GV bound

DOI10.1360/SSM-2019-0321zbMATH Open1499.11363OpenAlexW3118879625MaRDI QIDQ5064249FDOQ5064249

Authors: Xingyi Peng, Xiaojing Wang 

Publication date: 21 March 2022

Published in: SCIENTIA SINICA Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1360/ssm-2019-0321

Recommendations

• Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vladut-Zink bounds
• Asymptotic Improvement of the Gilbert–Varshamov Bound for Linear Codes
• scientific article; zbMATH DE number 1426184
• Algebraic-geometric codes and asymptotic problems
• Excellent Nonlinear Codes From Algebraic Function Fields

zbMATH Keywords

algebraic constructionasymptotic Gilbert-Varshamov boundlinear mapping families

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Cited In (1)

• On the statistical leak of the GGH13 multilinear map and some variants

This page was built for publication: A method of constructing linear mapping families to achieve the asymptotic GV bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5064249)