The MacWilliams-Sloane conjecture on the tightness of the Carlitz-Uchiyama bound and the weights of duals of BCH codes
DOI10.1109/18.340464zbMATH Open0828.94018OpenAlexW2151973746WikidataQ123102997 ScholiaQ123102997MaRDI QIDQ4850290FDOQ4850290
Authors: Oscar Moreno, Carlos Julio Moreno 
Publication date: 10 January 1996
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.340464
Recommendations
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15) Bounds on codes (94B65) Exponential sums (11T23)
Cited In (16)
- A \(p\)-adic Serre bound
- Weight of duals of BCH codes and exponential sums
- Divisibility of exponential sums via elementary methods
- Point count divisibility for algebraic sets over ℤ/𝕡^{ℓ}ℤ and other finite principal rings
- Recursions associated to trapezoid, symmetric and rotation symmetric functions over Galois fields
- Divisibility properties and new bounds for cyclic codes and exponential sums in one and several variables
- An improvement of a theorem of Carlitz
- Title not available (Why is that?)
- GRÖBNER BASIS TECHNIQUES TO COMPUTE WEIGHT DISTRIBUTIONS OF SHORTENED CYCLIC CODES
- Title not available (Why is that?)
- Exact $p$-divisibility of exponential sums via the covering method
- A divisibility approach to the open boundary cases of Cusick-Li-Stǎnicǎ's conjecture
- Exact 2-divisibility of exponential sums associated to Boolean functions
- Supersingular curves over finite fields and weight divisibility of codes
- Bounds on the minimum distance of the duals of extended BCH codes over \(\mathbb{F}_ p\)
- Modular periodicity of exponential sums of symmetric Boolean functions
This page was built for publication: The MacWilliams-Sloane conjecture on the tightness of the Carlitz-Uchiyama bound and the weights of duals of BCH codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4850290)
