On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
From MaRDI portal
Publication:2976715
DOI10.1109/TIT.2016.2570238zbMath1359.94721arXiv1506.04036OpenAlexW941231436MaRDI QIDQ2976715
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.04036
Related Items (20)
Rank error-correcting pairs ⋮ Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring ⋮ Defining the \(q\)-analogue of a matroid ⋮ Rank equivalent and rank degenerate skew cyclic codes ⋮ Linear cutting blocking sets and minimal codes in the rank metric ⋮ Classical access structures of ramp secret sharing based on quantum stabilizer codes ⋮ New MRD codes from linear cutting blocking sets ⋮ Evasive subspaces, generalized rank weights and near MRD codes ⋮ Systematic maximum sum rank codes ⋮ Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory ⋮ Partitions of matrix spaces with an application to \(q\)-rook polynomials ⋮ MacWilliams' extension theorem for rank-metric codes ⋮ Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets ⋮ A new rank metric for convolutional codes ⋮ Universal secure rank-metric coding schemes with optimal communication overheads ⋮ On defining generalized rank weights ⋮ On the roots and minimum rank distance of skew cyclic codes ⋮ Puncturing maximum rank distance codes ⋮ Theory of supports for linear codes endowed with the sum-rank metric ⋮ A geometric approach to rank metric codes and a classification of constant weight codes
This page was built for publication: On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
