An upper bound on the size of a code with the k-identifiable parent property - researchr publication references

researchr

You are not signed in
Sign in
Sign up

Simon R. Blackburn. An upper bound on the size of a code with the k-identifiable parent property. Journal of Combinatorial Theory, Series A, 102(1):179-185, 2003. [doi]

No references recorded for this publication.

No citations of this publication recorded.

runs on WebDSL