Pages that link to "Item:Q2267792"
From MaRDI portal
The following pages link to Minimal codewords in Reed-Muller codes (Q2267792):
Displaying 14 items.
- Minimum distance functions of graded ideals and Reed-Muller-type codes (Q326562) (← links)
- Minimum distance of relative Reed-Muller codes (Q734035) (← links)
- On the non-minimal codewords in binary Reed-Muller codes (Q1811092) (← links)
- Construction of minimal linear codes from multi-variable functions (Q2025361) (← links)
- On the maximum number of minimal codewords (Q2037586) (← links)
- Minimum weight bases for quaternary Reed-Muller codes (Q2058343) (← links)
- On the number of minimal codewords in codes generated by the adjacency matrix of a graph (Q2065789) (← links)
- Minimal binary linear codes: a general framework based on bent concatenation (Q2132451) (← links)
- On the non-minimality of the largest weight codewords in the binary Reed-Muller codes (Q2275886) (← links)
- Relative generalized Hamming weights of \(q\)-ary Reed-Muller codes (Q2408282) (← links)
- Ideal access structures based on a class of minimal linear codes (Q2958257) (← links)
- Minimal trellises for block codes (Q3816021) (← links)
- (Q4011780) (← links)
- On the minimum number of minimal codewords (Q6112238) (← links)