Enumerative Coding for Grassmannian Space

DOI10.1109/TIT.2010.2090252zbMath1366.94261arXiv0911.3256OpenAlexW2049948530MaRDI QIDQ5281130

Natalia Silberstein, Tuvi Etzion

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0911.3256

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Coding theorems (Shannon theory) (94A24)

Related Items (8)

Enumerative coding for line polar Grassmannians with applications to codes ⋮ New constructions of Sidon spaces ⋮ On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes ⋮ Bilateral multilevel construction of constant dimension codes ⋮ Message encoding and retrieval for spread and cyclic orbit codes ⋮ New lower bounds for partial k‐parallelisms ⋮ Constructions of optimal Ferrers diagram rank metric codes ⋮ Several classes of optimal Ferrers diagram rank-metric codes

This page was built for publication: Enumerative Coding for Grassmannian Space