Pages that link to "Item:Q2339444"
From MaRDI portal
The following pages link to The weight enumerators of several classes of \(p\)-ary cyclic codes (Q2339444):
Displaying 19 items.
- Two classes of cyclic codes and their weight enumerator (Q306044) (← links)
- Complete weight enumerators of some cyclic codes (Q310235) (← links)
- A class of \(p\)-ary cyclic codes and their weight enumerators (Q326322) (← links)
- A class of three-weight linear codes and their complete weight enumerators (Q502409) (← links)
- The weight distributions of two classes of \(p\)-ary cyclic codes with few weights (Q730374) (← links)
- The weight distributions of two classes of \(p\)-ary cyclic codes (Q740311) (← links)
- A lemma on polynomials modulo \(p^m\) and applications to coding theory (Q856866) (← links)
- Weight enumerators of codes derived from polynomial product algorithms (Q1356476) (← links)
- Split weight enumerators for the Preparata codes with applications to designs (Q1591640) (← links)
- On the weight distributions of a class of cyclic codes (Q1690242) (← links)
- A correction on the determination of the weight enumerator polynomial of some irreducible cyclic codes (Q1741923) (← links)
- Constant composition codes as subcodes of linear codes (Q2008052) (← links)
- Complete weight enumerators of a class of two-weight linear codes (Q2311420) (← links)
- Complete weight enumerators of a class of linear codes with two or three weights (Q2324504) (← links)
- The weight distributions of some binary cyclic codes. (Q2828977) (← links)
- On the weight distributions of some \(q\)-ary cyclic codes. (Q2829078) (← links)
- (Q4624453) (← links)
- Determining the Number of One-Weight Cyclic Codes When Length and Dimension Are Given (Q5426097) (← links)
- Infinite families of minimal binary codes via Krawtchouk polynomials (Q6544459) (← links)