An Upper Bound on the Size of a Code with the k-Identifiable Parent Property - researchr publication bibtex

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. IACR Cryptology ePrint Archive, 2002:101, 2002. [doi]

@article{Blackburn02-0,
  title = {An Upper Bound on the Size of a Code with the k-Identifiable Parent Property},
  author = {Simon R. Blackburn},
  year = {2002},
  url = {http://eprint.iacr.org/2002/101},
  researchr = {https://researchr.org/publication/Blackburn02-0},
  cites = {0},
  citedby = {0},
  journal = {IACR Cryptology ePrint Archive},
  volume = {2002},
  pages = {101},
}

runs on WebDSL