OPG-37196
Open
L1
Perfect 2-error-correcting codes over arbitrary finite alphabets.
Category:Combinatorics
Set:OpenGarden
Problem Statement
Background
About Combinatorics: Counting problems, graph theory, discrete structures.
Discussion (0)
No comments yet. Be the first to discuss this problem!
Sign in to start the conversation.
Checking sign-in status...