New characterization of optimal linear codes from down-sets
From MaRDI portal
Cites work
- A Bound for Error-Correcting Codes
- A class of optimal \(p\)-ary codes from one-weight codes over \(\mathbb F_p[u]/\langle u^m\rangle\)
- Binary linear codes with two or three weights from Niho exponents
- Binary self-orthogonal codes which meet the Griesmer bound or have optimal minimum distances
- Characterization of Plotkin-optimal two-weight codes over finite chain rings and some applications
- Covering and secret sharing with linear codes
- Embedding Linear Codes Into Self-Orthogonal Codes and Their Optimal Minimum Distances
- Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal Gray image
- Five classes of optimal two-weight linear codes
- Fundamentals of Error-Correcting Codes
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- Infinite Families of Optimal Linear Codes Constructed From Simplicial Complexes
- Minimal vectors in linear codes
- New classes of binary few weight codes from trace codes over a chain ring
- Nonexistence of several infinite families of binary self-orthogonal codes
- On relative constant-weight codes
- Optimal Few-Weight Codes From Simplicial Complexes
- Optimal non-projective linear codes constructed from down-sets
- Self-orthogonal codes from p-divisible codes
- Self-Orthogonality Matrix and Reed-Muller Codes
- Three new constructions of optimal linear codes with few weights
- Two classes of optimal p-ary few-weight codes from down-sets
- Two conjectures on the largest minimum distances of binary self-orthogonal codes with dimension 5
- Two infinite families of two-weight codes over \(\mathbb{Z}_{2^{m}}\)
This page was built for publication: New characterization of optimal linear codes from down-sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445105)