Mostra el registre d'ítem simple
On the representability of the biuniform matroid
dc.contributor.author | Ball, Simeon Michael |
dc.contributor.author | Padró Laimon, Carles |
dc.contributor.author | Weiner, Zsuzsa |
dc.contributor.author | Xing, Chaoping |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV |
dc.date.accessioned | 2014-09-18T16:05:12Z |
dc.date.available | 2014-09-18T16:05:12Z |
dc.date.created | 2013-08-22 |
dc.date.issued | 2013-08-22 |
dc.identifier.citation | Ball, S. [et al.]. On the representability of the biuniform matroid. "SIAM journal on discrete mathematics", 22 Agost 2013, vol. 27, núm. 3, p. 1482-1491. |
dc.identifier.issn | 0895-4801 |
dc.identifier.uri | http://hdl.handle.net/2117/24101 |
dc.description.abstract | Every biuniform matroid is representable over all sufficiently large fields. But it is not known exactly over which finite fields they are representable, and the existence of efficient methods to find a representation for every given biuniform matroid has not been proved. The interest of these problems is due to their implications to secret sharing. The existence of efficient methods to find representations for all biuniform matroids is proved here for the first time. The previously known efficient constructions apply only to a particular class of biuniform matroids, while the known general constructions were not proved to be efficient. In addition, our constructions provide in many cases representations over smaller finite fields. © 2013, Society for Industrial and Applied Mathematics |
dc.format.extent | 10 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Seguretat informàtica::Criptografia |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Combinatòria |
dc.subject.lcsh | Combinatorial analysis |
dc.subject.lcsh | Matroids |
dc.subject.other | matroid theory |
dc.subject.other | representable matroid |
dc.subject.other | biuniform matroid |
dc.subject.other | secret sharing |
dc.title | On the representability of the biuniform matroid |
dc.type | Article |
dc.subject.lemac | Matroides |
dc.subject.lemac | Criptografia |
dc.contributor.group | Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
dc.contributor.group | Universitat Politècnica de Catalunya. MAK - Matemàtica Aplicada a la Criptografia |
dc.identifier.doi | 10.1137/120886960 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | http://epubs.siam.org/doi/abs/10.1137/120886960 |
dc.rights.access | Open Access |
local.identifier.drac | 12889911 |
dc.description.version | Postprint (published version) |
dc.relation.projectid | info:eu-repo/grantAgreement/EC/FP7/227701/EU/From discrete to contimuous: understanding discrete structures through continuous approximation/DISCRETECONT |
local.citation.author | Ball, S.; Padro, C.; Weiner, Z.; Xing, C. |
local.citation.publicationName | SIAM journal on discrete mathematics |
local.citation.volume | 27 |
local.citation.number | 3 |
local.citation.startingPage | 1482 |
local.citation.endingPage | 1491 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [48]
-
Articles de revista [3.269]
-
Articles de revista [290]