Information sets and partial permutation decoding for codes from finite geometries
From MaRDI portal
Publication:2490139
Recommendations
Cites work
- Bases of minimum-weight vectors for codes from designs
- Bruck nets, codes, and characters of loops
- scientific article; zbMATH DE number 53917 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1263393 (Why is no real title available?)
- scientific article; zbMATH DE number 1284429 (Why is no real title available?)
- scientific article; zbMATH DE number 1284430 (Why is no real title available?)
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- On coverings
- Partial permutation decoding for codes from finite planes
- Permutation Decoding of Systematic Codes
Cited in
(31)- Partial permutation decoding for the first-order Reed-Muller codes
- Generalized information-set decoding of \((L,g)\)-codes
- Reed-Muller codes: information sets from defining sets
- Partial permutation decoding for codes from finite planes
- Codes from incidence matrices of graphs
- On the existence of PD-sets: algorithms arising from automorphism groups of codes
- Binary codes from \(m\)-ary \(n\)-cubes \(Q^m_n\)
- Codes from the incidence matrices of graphs on 3-sets
- Fast systematic encoding of multiplicity codes
- Information sets in abelian codes: defining sets and Groebner basis
- Hulls of codes from incidence matrices of connected regular graphs
- Partial permutation decoding for codes from affine geometry designs
- A survey on nonlinear Boolean functions with optimal algebraic immunity suitable for stream ciphers
- Codes from the line graphs of complete multipartite graphs and PD-sets
- New advances in permutation decoding of first-order Reed-Muller codes
- Permutation decoding of codes from generalized Paley graphs
- Codes associated with the odd graphs
- Codes in the Space of Multisets—Coding for Permutation Channels With Impairments
- scientific article; zbMATH DE number 840681 (Why is no real title available?)
- Codes from incidence matrices of some regular graphs
- Partial permutation decoding for MacDonald codes
- Improved partial permutation decoding for Reed-Muller codes
- Special \textit{LCD} codes from products of graphs
- Codes and designs from triangular graphs and their line graphs
- Parametric construction approach of balanced Boolean functions from two-to-one mappings
- Designer of codes: a tribute to Jennifer Key
- Reed-Muller codes and permutation decoding
- Binary codes from rectangular lattice graphs and permutation decoding
- Codes from incidence matrices and line graphs of Hamming graphs
- Binary codes from the line graph of the \(n\)-cube
- Antiblocking decoding
This page was built for publication: Information sets and partial permutation decoding for codes from finite geometries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2490139)