Proceedings of the conference on finite geometries, Oberwolfach, Germany, December 2--7, 2001
From MaRDI portal
Publication:1409591
DOI10.1007/S10623-012-9711-5zbMath1022.00500OpenAlexW2163978560MaRDI QIDQ1409591
No author found.
Publication date: 21 October 2003
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-012-9711-5
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06) Proceedings, conferences, collections, etc. pertaining to geometry (51-06)
Cites Work
- Unnamed Item
- Unnamed Item
- Codes that attain minimum distance in every possible direction
- Coding Theory Motivated by Relational Databases
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- The Perfect Binary One-Error-Correcting Codes of Length <formula formulatype="inline"><tex Notation="TeX">$15$</tex></formula>: Part I—Classification
- On the Existence of Armstrong Instances with Bounded Domains
This page was built for publication: Proceedings of the conference on finite geometries, Oberwolfach, Germany, December 2--7, 2001
