Lund University Publications
metadata only
Solving LPN Using Covering Codes
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
- On the lengths of MDS codes with a two-transitive permutation automorphism group#972228
- Additive codes arising from hypergraphs#1144647
- Codes and designs in multivariate $Q$-polynomial association schemes#615016
- Codes and designs in multivariate $Q$-polynomial association schemes#614049
- Introduction to coding theory and algebraic geometry. (Based on lectures given in the seminar held at Schloß Mickeln, Düsseldorf, November 16-21, 1987)#490301
Record · ID 288449
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