The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Este artigo considera uma codificação conjunta de canal e geração de números aleatórios a partir da saída do canal. Especificamente, queremos transmitir uma mensagem para um receptor de forma confiável e ao mesmo tempo o receptor extrai bits aleatórios puros, independentemente da entrada do canal. Chamamos esse problema de problema de codificação de canal conjunto e de aleatoriedade intrínseca. Para canais gerais, esclarecemos o compromisso entre a taxa de codificação e a taxa de bits aleatória extraída da saída do canal usando a região de taxa alcançável, onde tanto a probabilidade de erro de decodificação quanto o erro de aproximação de bits aleatórios desaparecem assintoticamente. Também revelamos as regiões de taxa alcançáveis para canais estacionários sem memória, canais aditivos, canais simétricos e canais mistos.
Tomohiko UYEMATSU
Tokyo Institute of Technology
Tetsunao MATSUTA
Tokyo Institute of Technology
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Tomohiko UYEMATSU, Tetsunao MATSUTA, "Joint Channel Coding and Intrinsic Randomness" in IEICE TRANSACTIONS on Fundamentals,
vol. E101-A, no. 12, pp. 2091-2098, December 2018, doi: 10.1587/transfun.E101.A.2091.
Abstract: This paper considers a joint channel coding and random number generation from the channel output. Specifically, we want to transmit a message to a receiver reliably and at the same time the receiver extracts pure random bits independent of the channel input. We call this problem as the joint channel coding and intrinsic randomness problem. For general channels, we clarify the trade-off between the coding rate and the random bit rate extracted from the channel output by using the achievable rate region, where both the probability of decoding error and the approximation error of random bits asymptotically vanish. We also reveal the achievable rate regions for stationary memoryless channels, additive channels, symmetric channels, and mixed channels.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.2091/_p
Copiar
@ARTICLE{e101-a_12_2091,
author={Tomohiko UYEMATSU, Tetsunao MATSUTA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Joint Channel Coding and Intrinsic Randomness},
year={2018},
volume={E101-A},
number={12},
pages={2091-2098},
abstract={This paper considers a joint channel coding and random number generation from the channel output. Specifically, we want to transmit a message to a receiver reliably and at the same time the receiver extracts pure random bits independent of the channel input. We call this problem as the joint channel coding and intrinsic randomness problem. For general channels, we clarify the trade-off between the coding rate and the random bit rate extracted from the channel output by using the achievable rate region, where both the probability of decoding error and the approximation error of random bits asymptotically vanish. We also reveal the achievable rate regions for stationary memoryless channels, additive channels, symmetric channels, and mixed channels.},
keywords={},
doi={10.1587/transfun.E101.A.2091},
ISSN={1745-1337},
month={December},}
Copiar
TY - JOUR
TI - Joint Channel Coding and Intrinsic Randomness
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2091
EP - 2098
AU - Tomohiko UYEMATSU
AU - Tetsunao MATSUTA
PY - 2018
DO - 10.1587/transfun.E101.A.2091
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E101-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2018
AB - This paper considers a joint channel coding and random number generation from the channel output. Specifically, we want to transmit a message to a receiver reliably and at the same time the receiver extracts pure random bits independent of the channel input. We call this problem as the joint channel coding and intrinsic randomness problem. For general channels, we clarify the trade-off between the coding rate and the random bit rate extracted from the channel output by using the achievable rate region, where both the probability of decoding error and the approximation error of random bits asymptotically vanish. We also reveal the achievable rate regions for stationary memoryless channels, additive channels, symmetric channels, and mixed channels.
ER -