1. Home
  2. CIDMA - Centro de Investigação e Desenvolvimento em Matemática e Aplicações
  3. CIDMA - Comunicações
Please use this identifier to cite or link to this item: http://hdl.handle.net/10773/24662
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNapp, Diegopt_PT
dc.contributor.authorPinto, Raquelpt_PT
dc.contributor.authorRosenthal, Joachimpt_PT
dc.contributor.authorVettori, Paolopt_PT
dc.date.accessioned2018-11-16T16:32:49Z-
dc.date.available2018-11-16T16:32:49Z-
dc.date.issued2018-07-
dc.identifier.urihttp://hdl.handle.net/10773/24662-
dc.description.abstractA new construction of maximum rank distance systematic rank metric convolutional codes is presented, which permits to reduce the computational complexity of the decoding procedure, i.e., of the underlying Viterbi algorithm. This result is achieved by lowering the number of branch metrics to be calculated and by setting to the highest value the metric of the remaining edges in the trellis.pt_PT
dc.language.isoengpt_PT
dc.relationinfo:eu-repo/grantAgreement/FCT/5876/147206/PTpt_PT
dc.rightsopenAccesspt_PT
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/pt_PT
dc.subjectConvolutional codespt_PT
dc.subjectRank metricpt_PT
dc.titleFaster Decoding of rank metric convolutional codespt_PT
dc.typeconferenceObjectpt_PT
dc.description.versionpublishedpt_PT
dc.peerreviewedyespt_PT
ua.event.date16-20 jul, 2018pt_PT
degois.publication.firstPage507pt_PT
degois.publication.lastPage510pt_PT
degois.publication.locationHong Kong University of Science and Technology, Hong Kongpt_PT
degois.publication.titleMTNS2018 - the 23rd International Symposium on Mathematical Theory of Networks and Systemspt_PT
dc.relation.publisherversionhttp://mtns2018.ust.hk/media/files/0071.pdfpt_PT
Appears in Collections:CIDMA - Comunicações

Files in This Item:
File Description SizeFormat 
MTNS18_0071.pdf186.64 kBAdobe PDFView/Open
Show simple item record


FacebookTwitterLinkedIn
Formato BibTex MendeleyEndnote Degois 

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