Lower bounds on almost-separating binary codes

José Moreira, Grigory Kabatiansky, Marcel Fernández

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

Separating codes have been used in many areas as diverse as automata synthesis, technical diagnosis and traitor tracing schemes. In this paper, we study a weak version of separating codes called almost separating codes. More precisely, we derive lower bounds on the rate of almost separating codes. From the main result it is seen that the lower bounds on the rate for almost separating codes are greater than the currently known lower bounds for ordinary separating codes. Moreover, we also show how almost separating codes can be used to construct a family of fingerprinting codes.

Original languageEnglish
Title of host publication2011 IEEE International Workshop on Information Forensics and Security, WIFS 2011
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event2011 IEEE International Workshop on Information Forensics and Security, WIFS 2011 - Iguacu Falls, Brazil
Duration: 29 Nov 20112 Dec 2011

Publication series

Name2011 IEEE International Workshop on Information Forensics and Security, WIFS 2011

Conference

Conference2011 IEEE International Workshop on Information Forensics and Security, WIFS 2011
Country/TerritoryBrazil
CityIguacu Falls
Period29/11/112/12/11

Fingerprint

Dive into the research topics of 'Lower bounds on almost-separating binary codes'. Together they form a unique fingerprint.

Cite this