DSpace
 
  Repositório Institucional da Universidade de Aveiro > CIDMA - Centro de Investigação e Desenvolvimento em Matemática e Aplicações > CIDMA - Artigos >
 Decoding of 2D convolutional codes over an erasure channel
Please use this identifier to cite or link to this item http://hdl.handle.net/10773/16612

title: Decoding of 2D convolutional codes over an erasure channel
authors: Climent, Joan-Josep
Napp, Diego
Pinto, Raquel
Simões, Rita
keywords: 1D finite support convolutional codes
2D finite support convolutional codes
Erasure channel
issue date: Feb-2016
publisher: American Institute of Mathematical Sciences
abstract: In this paper we address the problem of decoding 2D convolutional codes over an erasure channel. To this end we introduce the notion of neighbors around a set of erasures which can be considered an analogue of the notion of sliding window in the context of 1D convolutional codes. The main idea is to reduce the decoding problem of 2D convolutional codes to a problem of decoding a set of associated 1D convolutional codes. We first show how to recover sets of erasures that are distributed on vertical, horizontal and diagonal lines. Finally we outline some ideas to treat any set of erasures distributed randomly on the 2D plane. © 2016 AIMS.
URI: http://hdl.handle.net/10773/16612
ISSN: 1930-5346
publisher version/DOI: http://dx.doi.org/10.3934/amc.2016.10.179
source: Advances in Mathematics of Communications
appears in collectionsCIDMA - Artigos

files in this item

file description sizeformat
[2016] Decoding of 2DCC over an Erasure Channel_AMC.pdf559.99 kBAdobe PDFview/open
Restrict Access. You can Request a copy!
statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! RCAAP OpenAIRE DeGóis
ria-repositorio@ua.pt - Copyright ©   Universidade de Aveiro - RIA Statistics - Powered by MIT's DSpace software, Version 1.6.2