Skip to main content
Journal Article

Separating and intersecting properties of BCH and Kasami codes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2003) 2898 52-65
DOI: 10.1007/978-3-540-40974-8_5
3Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Separating codes have recently been applied in the construction of collusion secure fingerprinting schemes. They are related to other combinatorial concepts like intersecting codes, superimposed codes, hashing families, and group testing. In this paper we study some good, binary asymptotic constructions of such codes. © Springer-Verlag Berlin Heidelberg 2003.

Author supplied keywords

Cite

CITATION STYLE

APA

Schaathun, H. G., & Helleseth, T. (2003). Separating and intersecting properties of BCH and Kasami codes. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2898, 52–65. https://doi.org/10.1007/978-3-540-40974-8_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free