arXiv (All)
open access
Algorithms for Sampling Self-Orthogonal and Totally Self-Orthogonal Codes in Odd Characteristic
We give an algorithm that samples uniformly random linear codes of any hull dimension and type over finite fields of odd characteristic, implying the first algorithm for sampling uniformly random self-orthogonal codes of any rate, including self-dual codes. Our algorithm is a re-visitation of the al
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
- Efficient Polynomial-Time Decoding of Simplicial Anticodes with Near-Optimal Performance#798271
- Efficient Polynomial-Time Decoding of Simplicial Anticodes with Near-Optimal Performance#796858
- Universal Hashing and Geometric Codes#921554
- Quantum bivariate bicycle codes with weight-8 checks surpassing the BB benchmark#974684
- Non-Binary Quasi-Cyclic LDPC Codes with Entanglement Assistance#625320
Record · ID 1218456
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