A ``visible set in an ambient space for codes is one for which the minimum weight of any code spanned by a subset is the weight of one of the spanning words. Tensor products of visible sets are also visible, and from this one can obtain formulas for the minimum weights of certain modular group algebra codes.
Recommendations
Cites work
- An Occupation Time Theorem for the Angular Component of Plane Brownian Motion
- Classical codes as ideals in group algebras
- Error-correcting codes: An axiomatic approach
- scientific article; zbMATH DE number 3749242 (Why is no real title available?)
- New generalizations of the Reed-Muller codes--I: Primitive codes
- The Structure of the Group Ring of a p-Group Over a Modular Field
Cited in
(11)- Scroll codes
- Classical codes as ideals in group algebras
- On a complete decoding scheme for binary radical codes
- Super-visible codes
- Bases of minimum-weight vectors for codes from designs
- On the majority decodable distance of codes in filtrations of characteristic \(p>0\)
- Divisors of codes of Reed-Muller type
- Group algebras and coding theory
- A POLYNOMIAL RING CONSTRUCTION FOR THE CLASSIFICATION OF DATA
- Codes based on BCK-algebras
- On monomial codes in modular group algebras
This page was built for publication: Visible codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1824604)
