Pages that link to "Item:Q2025340"
From MaRDI portal
The following pages link to New bounds on the minimum distance of cyclic codes (Q2025340):
Displaying 16 items.
- Decoding of repeated-root cyclic codes up to new bounds on their minimum distance (Q259877) (← links)
- On some bounds on the minimum distance of cyclic codes over finite fields (Q498967) (← links)
- Hasse-Weil bound for additive cyclic codes (Q510473) (← links)
- A symmetric Roos bound for linear codes (Q855868) (← links)
- Roos bound for skew cyclic codes in Hamming and rank metric (Q1995207) (← links)
- A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes (Q2448068) (← links)
- A new class of distance-optimal binary cyclic codes and their duals (Q2682397) (← links)
- More on the minimum distance of cyclic codes (Q3197759) (← links)
- (Q3340770) (← links)
- A New Upper Bound on the Minimum Distance of Turbo Codes (Q3547501) (← links)
- A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set (Q3547985) (← links)
- A new procedure for decoding cyclic and BCH codes up to actual minimum distance (Q4324108) (← links)
- (Q4709560) (← links)
- A Bound on the Minimum Distance of Quasi-cyclic Codes (Q4915199) (← links)
- On the Minimal Distance of Binary Self-Dual Cyclic Codes (Q4974043) (← links)
- Decoding Cyclic Codes up to a New Bound on the Minimum Distance (Q5271924) (← links)
