A new rank metric for convolutional codes
Let F[D] be the polynomial ring with entries in a finite field F. Convolutional codes are submodules of F[D]n that can be described by left prime polynomial matrices. In the last decade there has been a great interest in convolutional codes equipped with a rank metric, called sum rank metric, due to...
Autor principal: | |
---|---|
Outros Autores: | |
Formato: | article |
Idioma: | eng |
Publicado em: |
2021
|
Assuntos: | |
Texto completo: | http://hdl.handle.net/10773/30369 |
País: | Portugal |
Oai: | oai:ria.ua.pt:10773/30369 |