Universal homophonic coding scheme using differential encoding and interleaving

dc.creatorSimoes, DR
dc.creatorPortugheis, J
dc.creatorda Rocha, VC
dc.date2013
dc.dateAUG 30
dc.date2014-07-30T19:32:54Z
dc.date2015-11-26T16:55:51Z
dc.date2014-07-30T19:32:54Z
dc.date2015-11-26T16:55:51Z
dc.date.accessioned2018-03-28T23:43:17Z
dc.date.available2018-03-28T23:43:17Z
dc.identifierInformation Processing Letters. Elsevier Science Bv, v. 113, n. 17, n. 628, n. 633, 2013.
dc.identifier0020-0190
dc.identifierWOS:000322295500008
dc.identifier10.1016/j.ipl.2013.05.010
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/73434
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/73434
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1277233
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionA universal homophonic coding scheme is introduced which combines properties of differential encoding and homophonic symbol interleaving. The use of a uniform random interleaver is discussed and it is argued that asymptotically, when the interleaver length grows to infinity, the homophonic coding scheme generates a sequence of independent and uniformly distributed binary digits. For practical reasons, an interleaver with a complexity that grows linearly with its length is proposed. As a consequence, both the generation and the recovery of the digits produced by the proposed universal homophonic coding scheme are easy to implement. Validation tests for this new universal homophonic coding scheme were performed using the statistical test suite IR 6483 available from the National Institute of Standards and Technology, USA, and the corresponding computer simulation results are presented. The statistical tests demonstrate that the performance of the proposed universal homophonic coding scheme is at least as good as that of other published schemes, however with a significant reduction in plaintext expansion. (C) 2013 Elsevier B.V. All rights reserved.
dc.description113
dc.description17
dc.description628
dc.description633
dc.descriptionPernambuco State Foundation [IBPG-0222-3.04/08]
dc.descriptionSao Paulo State Foundation [2007/56052-8]
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionPernambuco State Foundation [IBPG-0222-3.04/08]
dc.descriptionSao Paulo State Foundation [2007/56052-8]
dc.descriptionCNPq [304696/2010-2]
dc.languageen
dc.publisherElsevier Science Bv
dc.publisherAmsterdam
dc.publisherHolanda
dc.relationInformation Processing Letters
dc.relationInf. Process. Lett.
dc.rightsfechado
dc.rightshttp://www.elsevier.com/about/open-access/open-access-policies/article-posting-policy
dc.sourceWeb of Science
dc.subjectHomophonic coding
dc.subjectUniversal homophonic coding
dc.subjectSource coding
dc.subjectCryptography
dc.subjectRandom Number Generators
dc.subjectData Compression
dc.titleUniversal homophonic coding scheme using differential encoding and interleaving
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución