Pasar al contenido principal

DECODIFICACION ITERATIVA CON LONGITUD FINITA: LIMITES FUNDAMENTALES, CONSTRUCCIONES PRACTICAS E INFERENCIA

TEC2016-78434-C3-1-R

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos I+D+i Retos de Investigación
Año convocatoria 2016
Plan Estatal 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSITAT POMPEU FABRA CCT

Resultados relacionados

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

Repositorio Digital de la UPF
Publicación Contribución de congreso (ConferenceOutput)

Asymptotics of the random coding error probability for constant-composition codes

  • Font-Segura, Josep
  • Martínez, Alfonso, 1973-
  • Guillén i Fábregas, A. (Albert)
Comunicació presentada a 2019 IEEE International Symposium on Information Theory (ISIT), celebrada del 7 al 12 de juliol de 2019 a Paris, França., Saddlepoint approximations to the error probability are derived for multiple-cost-constrained random coding ensembles where codewords satisfy a set of constraints. Constantcomposition inputs over a binary symmetric channel are studied as a particular case. For codewords with equiprobable empirical distribution, the analysis recovers the same error exponent and pre-exponential polynomial decay as the uniform i.i.d. ensemble and provides an explicit formula for the loss in prefactor (thirdorder term) incurred by the constant-composition ensemble., This work has been funded in part by the European Research Council under grant 725411, and by the Spanish Ministry of Economy and Competitiveness under grant TEC2016-78434-C3-1-R.
Repositorio Digital de la UPF
Publicación Contribución de congreso (ConferenceOutput)

Asymptotics of the error probability in quasi-static binary symmetric channels

  • Font-Segura, Josep
  • Martínez, Alfonso, 1973-
  • Guillén i Fábregas, A. (Albert)
Comunicació presentada a 2017 IEEE International Symposium on Information Theory (ISIT), celebrada del 25 al 30 de juny de 2017 a Aachen, Alemania., This paper provides an asymptotic expansion of the error probability, as the codeword length n goes to infinity, in quasi-static binary symmetric channels. After the leading term, namely the outage probability, the next two terms are found to be proportional to log n n and 1 n respectively. Explicit characterizations of the respective coefficients are given. The resulting expansion gives an approximation to the random-coding union bound, accurate even at small codeword lengths., This work has been funded in part by the European Research Council under ERC grant agreement 259663 and by the Spanish Ministry of Economy and Competitiveness under grants RYC-2011-08150, FJCI-2014-22747, and TEC2016-78434-C3-1-R.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Asymptotics of the error probability in quasi-static binary symmetric channels

  • Font-Segura, Josep
  • Martínez, Alfonso, 1973-
  • Guillén i Fábregas, A. (Albert)
Comunicació presentada a 2017 IEEE International Symposium on Information Theory (ISIT), celebrada del 25 al 30 de juny de 2017 a Aachen, Alemania., This paper provides an asymptotic expansion of the error probability, as the codeword length n goes to infinity, in quasi-static binary symmetric channels. After the leading term, namely the outage probability, the next two terms are found to be proportional to log n n and 1 n respectively. Explicit characterizations of the respective coefficients are given. The resulting expansion gives an approximation to the random-coding union bound, accurate even at small codeword lengths., This work has been funded in part by the European Research Council under ERC grant agreement 259663 and by the Spanish Ministry of Economy and Competitiveness under grants RYC-2011-08150, FJCI-2014-22747, and TEC2016-78434-C3-1-R.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Asymptotics of the random coding error probability for constant-composition codes

  • Font-Segura, Josep
  • Martínez, Alfonso, 1973-
  • Guillén i Fábregas, A. (Albert)
Comunicació presentada a 2019 IEEE International Symposium on Information Theory (ISIT), celebrada del 7 al 12 de juliol de 2019 a Paris, França., Saddlepoint approximations to the error probability are derived for multiple-cost-constrained random coding ensembles where codewords satisfy a set of constraints. Constantcomposition inputs over a binary symmetric channel are studied as a particular case. For codewords with equiprobable empirical distribution, the analysis recovers the same error exponent and pre-exponential polynomial decay as the uniform i.i.d. ensemble and provides an explicit formula for the loss in prefactor (thirdorder term) incurred by the constant-composition ensemble., This work has been funded in part by the European Research Council under grant 725411, and by the Spanish Ministry of Economy and Competitiveness under grant TEC2016-78434-C3-1-R.