On bases of BCH codes with designed distance 3 and their extensions
From MaRDI portal
Publication:2229574
DOI10.1134/S003294602004002XzbMATH Open1481.94155OpenAlexW3122286719MaRDI QIDQ2229574FDOQ2229574
Authors: Ivan Yu. Mogilnykh, Faina I. Solov'eva
Publication date: 18 February 2021
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s003294602004002x
Recommendations
Cites Work
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal Ternary Cyclic Codes From Monomials
- Some results on cyclic codes which are invariant under the affine group and their applications
- Algebraic property testing: the role of invariance
- Title not available (Why is that?)
- Studying the locator polynomials of minimum weight codewords of BCH codes
- On binary cyclic codes of odd lengths from 101 to 127
- On the minimum distances of non-binary cyclic codes
- On explicit minimum weight bases for extended cyclic codes related to Gold functions
- Explicit Low-Weight Bases for BCH Codes
Cited In (3)
This page was built for publication: On bases of BCH codes with designed distance 3 and their extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229574)