Paper 2002/101 Original: eprint.iacr.org/2002/101 ↗
An Upper Bound on the Size of a Code with the $k$-Identifiable Parent Property
Abstract
The paper gives an upper bound on the size of a $q$-ary code of length $n$ that has the $k$-identifiable parent property. One consequence of this bound is that the optimal rate of such a code is determined in many cases when $q\rightarrow\infty$ with $k$ and $n$ fixed.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2002-07-25: last updated
- 2002-07-25: published
- Short URL
- https://ia.cr/2002/101
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2002/101,
author = {Simon R. Blackburn},
title = {An Upper Bound on the Size of a Code with the $k$-Identifiable Parent Property},
howpublished = {Cryptology {ePrint} Archive, Paper 2002/101},
year = {2002},
url = {https://eprint.iacr.org/2002/101}
}