Zobrazeno 1 - 10
of 127
pro vyhledávání: '"Albert Guillen i Fabregas"'
Publikováno v:
2022 IEEE Information Theory Workshop (ITW).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9d06e297e965a4842d540e90dd3c0f4f
https://doi.org/10.1109/itw54588.2022.9965881
https://doi.org/10.1109/itw54588.2022.9965881
Publikováno v:
2022 IEEE Information Theory Workshop (ITW).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6e2e7f7ede4781b232bf3cc97aa57549
https://doi.org/10.1109/itw54588.2022.9965922
https://doi.org/10.1109/itw54588.2022.9965922
Comunicació presentada a 2022 IEEE International Symposium on Information Theory (ISIT), celebrat del 26 de juny a l'1 de juliol de 2022 a Espoo, Finlàndia. We derive a lower bound on the typical random-coding (TRC) exponent of pairwise-independent
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f56138311d06aad29b69d386143e1bb
http://hdl.handle.net/10230/55729
http://hdl.handle.net/10230/55729
We study the problem of mismatched binary hypothesis testing between i.i.d. distributions. We analyze the tradeoff between the pairwise error probability exponents when the actual distributions generating the observation are different from the distri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0db6ce17ef202041a744d42fb686903d
http://hdl.handle.net/10230/55587
http://hdl.handle.net/10230/55587
We derive an upper bound on the reliability function of mismatched decoding for zero-rate codes. The bound is based on a result by Koml ́os that shows the existence of a subcode with certain symmetry properties. The bound is shown to coincide with t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c2d04d29a58da061379e23a7232cb099
We derive a single-letter upper bound to the mismatched-decoding capacity for discrete memoryless channels. The bound is expressed as the mutual information of a transformation of the channel, such that a maximum-likelihood decoding error on the tran
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::614ccba09e4679a786f1277daf435434
This work studies the deviations of the error exponent of the constant composition code ensemble around its expectation, known as the error exponent of the typical random code (TRC). In particular, it is shown that the probability of randomly drawing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5d6d00e6cb1ffad05d32cd6dc03be2ec
Shannon's channel coding theorem characterizes the maximal rate of information that can be reliably transmitted over a communication channel when optimal encoding and decoding strategies are used. In many scenarios, however, practical considerations
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2cee9f2de499e9fe5838ef2d44def09e
http://arxiv.org/abs/2003.11694
http://arxiv.org/abs/2003.11694
This paper proposes an efficient simulation method based on importance sampling to estimate the random-coding error probability of coded modulation. The technique is valid for complex-valued modulations over Gaussian channels, channels with memory, a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6e4be48a66c9ca339170ccdc717f8bac
https://www.repository.cam.ac.uk/handle/1810/298310
https://www.repository.cam.ac.uk/handle/1810/298310
Publikováno v:
IEEE Transactions on Information Theory
We introduce a random coding technique for transmission over discrete memoryless channels, reminiscent of the basic construction attaining the Gilbert-Varshamov bound for codes in Hamming spaces. The code construction is based on drawing codewords re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bf8fd4662545dd8de6a419007f75e5f6