Please use this identifier to cite or link to this item:
http://hdl.handle.net/10773/18079
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Napp, Diego | pt |
dc.contributor.author | Pinto, Raquel | pt |
dc.contributor.author | Rosenthal, Joachim | pt |
dc.contributor.author | Vettori, Paolo | pt |
dc.date.accessioned | 2017-07-14T13:41:50Z | - |
dc.date.available | 2017-07-14T13:41:50Z | - |
dc.date.issued | 2017 | - |
dc.identifier.isbn | 978-1-5090-4095-7 | - |
dc.identifier.issn | 2157-8117 | - |
dc.identifier.uri | http://hdl.handle.net/10773/18079 | - |
dc.description.abstract | So far, in the area of Random Linear Network Coding, attention has been given to the so-called one-shot network coding, meaning that the network is used just once to propagate the information. In contrast, one can use the network more than once to spread redundancy over different shots. In this paper, we propose rank metric convolutional codes for this purpose. The framework we present is slightly more general than the one which can be found in the literature. We introduce a rank distance, which is suitable for convolutional codes, and derive a new Singleton-like upper bound. Codes achieving this bound are called Maximum Rank Distance (MRD) convolutional codes. Finally, we prove that this bound is optimal by showing a concrete construction of a family of MRD convolutional codes. | pt |
dc.language.iso | eng | pt |
dc.publisher | IEEE | pt |
dc.relation | FCT - UID/MAT/04106/2013 | pt |
dc.relation | Swiss National Science Foundation grant no. 169510 | pt |
dc.rights | openAccess | por |
dc.subject | Convolutional codes | pt |
dc.subject | Rank metric | pt |
dc.title | MRD Rank Metric Convolutional Codes | pt |
dc.type | conferenceObject | pt |
dc.peerreviewed | yes | pt |
ua.publicationstatus | published | pt |
ua.event.date | 25-30 junho, 2017 | pt |
ua.event.type | conference | pt |
degois.publication.location | Aachen, Germany | pt |
degois.publication.title | ISIT 2017: IEEE International Symposium on Information Theory | pt |
dc.relation.publisherversion | https://isit2017.org/ | pt |
Appears in Collections: | CIDMA - Comunicações SCG - Comunicações |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
isit17.pdf | Article | 165.3 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.