Mostra el registre d'ítem simple

dc.contributor.authorFernández Muñoz, Marcel
dc.contributor.authorJiménez Urroz, Jorge
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Enginyeria Telemàtica
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtiques
dc.date.accessioned2022-04-12T09:27:15Z
dc.date.available2022-04-12T09:27:15Z
dc.date.issued2022-02
dc.identifier.citationFernandez, M.; Jimenez, J. A study of the separating property in Reed-Solomon codes by bounding the minimum distance. "Designs, Codes, and Cryptography", Febrer 2022, vol. 90, p. 427-442.
dc.identifier.issn1573-7586
dc.identifier.otherhttps://arxiv.org/abs/2103.02341
dc.identifier.urihttp://hdl.handle.net/2117/365730
dc.descriptionThe version of record is available online at: http://dx.doi.org/10.1007/s10623-021-00988-z
dc.description.abstractAccording to their strength, the tracing properties of a code can be categorized as frameproof, separating, IPP and TA. It is known that, if the minimum distance of the code is larger than a certain threshold then the TA property implies the rest. Silverberg et al. ask if there is some kind of tracing capability left when the minimum distance falls below the threshold. Under different assumptions, several papers have given a negative answer to the question. In this paper, further progress is made. We establish values of the minimum distance for which Reed-Solomon codes do not posses the separating property.
dc.description.sponsorshipThis work has been supported by the Spanish Government Grant TCO-RISEBLOCK (PID2019-110224RB-I00) MINECO .
dc.format.extent16 p.
dc.language.isoeng
dc.rightsAttribution 4.0 International
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica aplicada a les ciències
dc.subject.lcshCoding theory
dc.subject.otherReed-Solomon codes
dc.subject.otherIPP codes
dc.subject.otherSeparating codes
dc.titleA study of the separating property in Reed-Solomon codes by bounding the minimum distance
dc.typeArticle
dc.subject.lemacCodificació, Teoria de la
dc.contributor.groupUniversitat Politècnica de Catalunya. ISG - Grup de Seguretat de la Informació
dc.contributor.groupUniversitat Politècnica de Catalunya. TN - Grup de Recerca en Teoria de Nombres
dc.identifier.doi10.1007/s10623-021-00988-z
dc.description.peerreviewedPeer Reviewed
dc.subject.amsClassificació AMS::94 Information And Communication, Circuits::94C Circuits, networks
dc.relation.publisherversionhttps://link.springer.com/article/10.1007%2Fs10623-021-00988-z
dc.rights.accessOpen Access
local.identifier.drac32544191
dc.description.versionPostprint (published version)
dc.relation.projectidinfo:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-110224RB-I00/ES/PRIVACIDAD Y SEGURIDAD EN BLOCKCHAINS PUBLICAS Y SUS APLICACIONES A LOS MERCADOS DE DATOS/
local.citation.authorFernandez, M.; Jimenez, J.
local.citation.publicationNameDesigns, Codes, and Cryptography
local.citation.volume90
local.citation.startingPage427
local.citation.endingPage442


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple