On the duals of binary BCH codes
From MaRDI portal
Publication:4544644
DOI10.1109/18.930939zbMATH Open0999.94039OpenAlexW2125216943MaRDI QIDQ4544644FDOQ4544644
Authors: José Felipe Voloch
Publication date: 4 August 2002
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/b0e8addb106ef8561c2343e2eb2799033170dc1d
Recommendations
- Weight of duals of BCH codes and exponential sums
- Bounds on the minimum distance of the duals of BCH codes
- scientific article; zbMATH DE number 493081
- Asymptotic estimation of the minimum distance of the duals of BCH codes and Dickson polynomials
- Bounds on the minimum distance of the duals of extended BCH codes over \(\mathbb{F}_ p\)
Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Cited In (7)
- Fast dimension reduction using Rademacher series on dual BCH codes
- Dual distance of BCH codes
- On the spectra of the duals of binary BCH codes of designed distance delta =9
- The weights of the duals of binary bch codes of designed distance δ=9
- Upper bounds on the dual distance of BCH\((255, k)\)
- On the distance distribution of duals of BCH codes
- Title not available (Why is that?)
This page was built for publication: On the duals of binary BCH codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544644)