Hadamard Codes and Sphere Packing
Read OriginalThis article discusses the application of Hadamard matrices to sphere packing, a topic in mathematics and coding theory. It explains Construction A by Conway and Sloane, which maps binary codes to sphere packings. The author illustrates how a Hadamard code of order 32 can be used for error correction, and how a similar construction for order 8 yields the E8 lattice, known as the densest sphere packing in 8 dimensions. The post is technical, aimed at readers with background in coding theory or discrete geometry, and references the book 'Sphere Packings, Lattices and Groups'.
Comments
No comments yet
Be the first to share your thoughts!
Browser Extension
Get instant access to AllDevBlogs from your browser
Top of the Week
1
Limit token usage in Microsoft Agent Framework
Jesse Liberty
•
1 votes
2
How to Roll Back AI Agents: Incident Response, Circuit Breakers, and Recovery Patterns
Paul Bryant
•
1 votes
3
Avoiding Reasoning Model Failures with Microsoft Foundry
Luke Murray
•
1 votes
4
When Your AI Agent Lies: Silent LLM Fallbacks
Luke Murray
•
1 votes
5
Adding a custom MCP server to Claude and ChatGPT
Simon Willison
•
1 votes
6
Testing AI prompts and comparing models with promptfoo
Tim Deschryver
•
1 votes
7
Superlogical
Mitchell Hashimoto
•
1 votes