Construction of several classes of maximum codes
From MaRDI portal
Publication:5063292
DOI10.1142/S179383092150110XzbMath1501.94092OpenAlexW3134614309MaRDI QIDQ5063292
Mengxin Lv, Weihua Yang, Xiao-Min Hu
Publication date: 17 March 2022
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s179383092150110x
Cites Work
- Unnamed Item
- Unnamed Item
- The complete intersection theorem for systems of finite sets
- Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes
- Bounds for binary codes of length less than 25
- Fundamentals of Error-Correcting Codes
- Error Detecting and Error Correcting Codes
- Improved upper bounds on sizes of codes
- Classification of Binary Constant Weight Codes
- On upper bounds for unrestricted binary-error-correcting codes
This page was built for publication: Construction of several classes of maximum codes