Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 3
Encontrada(s) 1 página(s)

Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Polar coding for common message only wiretap broadcast channel

  • Olmo Alòs, Jaume del
  • Rodríguez Fonollosa, Javier
A polar coding scheme is proposed for the Wiretap Broadcast Channel with two legitimate receivers and one eavesdropper. We consider a model in which the transmitter wishes to send a private and a confidential message that must be reliably decoded by the receivers, and the confidential message must also be (strongly) secured from the eavesdropper. The coding scheme aims to use the optimal rate of randomness and does not make any assumption regarding the symmetry or degradedness of the channel. This paper extends previous work on polar codes for the wiretap channel by proposing a new chaining construction that allows to reliably and securely send the same confidential bmessage to two different receivers. This construction introduces new dependencies between the random variables involved in the coding scheme that need to be considered in the secrecy analysis., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Publicness, privacy and confidentiality in the single-serving quantum broadcast channel

  • Salek Shishavan, Farzin
  • Hsieh, Min-Hsiu
  • Rodríguez Fonollosa, Javier
The 2-receiver broadcast channel with primary and third-party receivers is studied. The messages are classified into public, private and confidential. The messages in the public class are messages intended for both receivers. The private messages are intended for the primary receiver with no secrecy requirements imposed upon them. And the confidential messages are aimed exclusively to the primary receiver such that they must not be accessible to the other receiver. The encoder performs the necessary encryption by virtue of local randomness whose rate is assumed to be limited. We find an achievability region on the trade-off between the rates of the three messages and the source of randomness in the one-shot regime of a quantum broadcast channel., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Learning from unequally reliable blind ensembles of classifiers

  • Traganitis, Panagiotis
  • Pagès Zamora, Alba Maria
  • Giannakis, Georgios B.
© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., The rising interest in pattern recognition and data analytics has spurred the development of a plethora of machine learning algorithms and tools. However, as each algorithm has its strengths and weaknesses, one is motivated to judiciously fuse multiple algorithms in order to find the “best” performing one, for a given dataset. Ensemble learning aims to create a high- performance meta-algorithm, by combining the outputs from multiple algorithms. The present work introduces a simple blind scheme for learning from ensembles of classifiers, using joint matrix factorization. Blind refers to the combiner who has no knowledge of the ground-truth labels that each classifier has been trained on. Performance is evaluated on synthetic and real datasets., Peer Reviewed, Postprint (author's final draft)