Pages that link to "Item:Q1705522"

The following pages link to Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound (Q1705522):

Displaying 18 items.

• New asymptotic lower bounds on the free distance for time-constant convolutional codes (Q1083430) (← links)
• Constructions and bounds for batch codes with small parameters (Q1705537) (← links)
• Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 (Q1727355) (← links)
• An asymptotically optimal construction of almost affinely disjoint subspaces (Q2081335) (← links)
• Parallel sub-code construction for constant-dimension codes (Q2099164) (← links)
• Enhancing Echelon-Ferrers construction for constant dimension code (Q2103101) (← links)
• New constant dimension subspace codes from parallel linkage construction and multilevel construction (Q2130037) (← links)
• Subspace packings: constructions and bounds (Q2200513) (← links)
• Johnson type bounds for mixed dimension subspace codes (Q2323816) (← links)
• New constructions of constant dimension codes by improved inserting construction (Q2698184) (← links)
• A New Upper Bound for the Dimension of Trace Codes (Q3988559) (← links)
• (Q4502649) (← links)
• Asymptotically exact bounds on the size of high-order spectral-null codes (Q4503370) (← links)
• Subspace code based on flats in affine space over finite fields (Q4644788) (← links)
• The interplay of different metrics for the construction of constant dimension codes (Q6112228) (← links)
• Combining subspace codes (Q6112253) (← links)
• Asymptotically optimal \([2k+1,k,k]_q\)-almost affinely disjoint subspaces (Q6570056) (← links)
• New constant dimension subspace codes from multilevel linkage construction (Q6584303) (← links)