| dc.contributor.author | Fernández Muñoz, Marcel |
| dc.contributor.author | Cotrina Navau, Josep |
| dc.contributor.author | Soriano Ibáñez, Miguel |
| dc.contributor.author | Domingo, Neus |
| dc.contributor.other | Universitat Politècnica de Catalunya. Departament d'Enginyeria Telemàtica |
| dc.date.accessioned | 2014-05-30T11:47:54Z |
| dc.date.created | 2007 |
| dc.date.issued | 2007 |
| dc.identifier.citation | Fernandez, M. [et al.]. A note about the traceability properties of linear codes. A: International Conference on Information Security and Cryptology. "Information Security and Cryptology: ICISC 2007: 10th International Conference: Seoul, Korea, November 29-30, 2007: proceedings". Seoul: Springer, 2007, p. 251-258. |
| dc.identifier.isbn | 978-3-540-76787-9 |
| dc.identifier.uri | http://hdl.handle.net/2117/23108 |
| dc.description.abstract | We characterize the traceability properties of linear codes. It is well known that any code of length n and minimum distance d is a c-TA code if c 2¿<¿n/(n¿-¿d). In this paper, we show that a less restrictive condition can be derived. In other words, there exists a value Z C , with n¿-¿d¿=¿Z C ¿=¿c(n¿-¿d), such that any linear code is c-TA if c¿<¿n/Z C . We also prove that in many cases this condition is also necessary. These results are applied to cyclic and Reed-Solomon codes. |
| dc.format.extent | 8 p. |
| dc.language.iso | eng |
| dc.publisher | Springer |
| dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
| dc.subject | Àrees temàtiques de la UPC::Informàtica::Seguretat informàtica::Criptografia |
| dc.subject | Àrees temàtiques de la UPC::Enginyeria de la telecomunicació |
| dc.subject.lcsh | Cryptography |
| dc.subject.lcsh | Computer security |
| dc.subject.other | Data Encryption |
| dc.subject.other | Discrete Mathematics in Computer Science |
| dc.subject.other | Systems and Data Security |
| dc.subject.other | Management of Computing and Information Systems |
| dc.subject.other | Algorithm Analysis and Problem Complexity |
| dc.subject.other | Computer Communication Networks |
| dc.title | A note about the traceability properties of linear codes |
| dc.type | Conference report |
| dc.subject.lemac | Criptografia |
| dc.subject.lemac | Seguretat informàtica |
| dc.contributor.group | Universitat Politècnica de Catalunya. SERTEL - Serveis Telemàtics |
| dc.contributor.group | Universitat Politècnica de Catalunya. WNG - Grup de xarxes sense fils |
| dc.identifier.doi | 10.1007/978-3-540-76788-6_20 |
| dc.description.peerreviewed | Peer Reviewed |
| dc.relation.publisherversion | http://link.springer.com/chapter/10.1007/978-3-540-76788-6_20 |
| dc.rights.access | Restricted access - publisher's policy |
| local.identifier.drac | 12934894 |
| dc.description.version | Postprint (published version) |
| dc.date.lift | 10000-01-01 |
| local.citation.author | Fernandez, M.; Cotrina, J.; Soriano, M.; Domingo, N. |
| local.citation.contributor | International Conference on Information Security and Cryptology |
| local.citation.pubplace | Seoul |
| local.citation.publicationName | Information Security and Cryptology: ICISC 2007: 10th International Conference: Seoul, Korea, November 29-30, 2007: proceedings |
| local.citation.startingPage | 251 |
| local.citation.endingPage | 258 |
