Subspace code based on flats in affine space over finite fields

DOI10.1142/S1793830918500787zbMath1420.94117OpenAlexW2890607155WikidataQ129236095 ScholiaQ129236095MaRDI QIDQ4644788

Gang Wang, Min-Yao Niu, You Gao, Fang-Wei Fu

Publication date: 9 January 2019

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830918500787

zbMATH Keywords

finite fieldsErdős-Ko-Rado theoremaffine spaceboundsubspace code

Mathematics Subject Classification ID

Cryptography (94A60) Bounds on codes (94B65)

Related Items (1)

Bounds on subspace codes based on subspaces of type \((s,0,0,0)\) in pseudo-symplectic spaces and singular pseudo-symplectic spaces

Cites Work

• Construction of subspace codes through linkage
• Johnson type bounds on constant dimension codes
• Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
• Error-correcting codes in attenuated space over finite fields
• Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space
• The Erdős-Ko-Rado theorem for finite affine spaces
• Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• A Random Linear Network Coding Approach to Multicast
• Coding for Errors and Erasures in Random Network Coding
• A Rank-Metric Approach to Error Control in Random Network Coding
• Network information flow
• Linear authentication codes: bounds and constructions
• Error-Correcting Codes in Projective Space
• Packing and Covering Properties of Subspace Codes for Error Control in Random Linear Network Coding
• Intersecting families of permutations

This page was built for publication: Subspace code based on flats in affine space over finite fields