Pages that link to "Item:Q4677576"
From MaRDI portal
The following pages link to Random codes: minimum distances and error exponents (Q4677576):
Displaying 12 items.
- Memoryless near-collisions via coding theory (Q663464) (← links)
- Random subcubes as a toy model for constraint satisfaction problems (Q937116) (← links)
- Differential subordination and convexity criteria of integral operators (Q1698470) (← links)
- Density of free modules over finite chain rings (Q2158271) (← links)
- Syntactic structures and code parameters (Q2364907) (← links)
- Asymptotic behaviour of codes in rank metric over finite fields (Q2439748) (← links)
- A Computability Challenge: Asymptotic Bounds for Error-Correcting Codes (Q2891310) (← links)
- An Efficient Attack on All Concrete KKS Proposals (Q3102786) (← links)
- (Q4568110) (← links)
- (Q4638056) (← links)
- One more proof of the first linear programming bound for binary codes and two conjectures (Q6050274) (← links)
- Densities of codes of various linearity degrees in translation-invariant metric spaces (Q6130607) (← links)
