Digital Commons @ Michigan Tech
metadata only
Dense Sphere Packings from New Codes
The idea behind the coset code construction (see [G.D. Forney, Coset Codes, IEEE Transactions on Information Theory, Part I: Introduction and Geometrical Classification, pp. 1123-1151; Part II: Binary lattices and related codes, pp. 1152-1187; F.R. Kschischang and S. Pasupathy, IEEE Transactions on
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 Generalized Packing and Covering Radii of Codes#1083909
- 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
- Universal Hashing and Geometric Codes#921554
- Periodicity of weight enumerators for codes generated by an integral matrix#1069734
- An end-to-end packing detection method based on autoencoder features#309951
Record · ID 921557
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