arXiv (All)
open access
Some constructions of non-generalized Reed-Solomon MDS Codes
We investigate two classes of extended codes and provide necessary and sufficient conditions for these codes to be non-GRS MDS codes. We also determine the parity check matrices for these codes. Using the connection of MDS codes with arcs in finite projective spaces, we give a new characterization o
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Two Families of Linear Codes Containing Non-GRS MDS Codes#1342376
- Full classification of $\mathbb{Z}_{p^s}$-linear generalized Hadamard codes#1343920
- Optimal-Access Cooperative MSR Codes: Parity-Check Matrix Construction And a Unified Transformation#973953
- New Minimum Storage Regenerating Codes With Small Sub-packetization Levels for All Admissible Repair Degrees#1326579
- Cryptography based on error correcting codes#460193
Record · ID 1342324
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive