OpenAlex
PricingAboutJobs
Log inGet started
Work

Improved Lower Bounds on the Minimum Distances of the Dual Codes of Primitive Narrow-Sense BCH Codes

HTML

Year: 2024
Type: article
Source: IEEE Transactions on Information Theory
DOI: 10.1109/tit.2024.3487227
Authors: Chunyu Gan, Chengju Li, Sihem Mesnager, Conghui Xie, Haiyan Zhou
Institutions: East China Normal University, Université Paris 8, Jinan University, Nanjing Normal University
Language: English

Topic: Coding theory and cryptography
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences

Open Access status: closed

Funders: National Science Foundation, Natural Science Foundation of Shanghai, Agence Nationale de la Recherche, National Natural Science Foundation of China, Shanghai Rising-Star Program
Awards: G1245428710, G163520829, algeBrA, pRoofs, Algorithms, Curves and sUrfaces for coDes and their Applications, G4814151915, G5891181336, 代数整数环上K-群及相关问题的研究
OpenAlex ID: W4403827308
FWCI: 0.295
Cites: 42
Cited by: 2
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms