The following pages link to Ernst M. Gabidulin (Q935615):
Displaying 48 items.
- (Q361694) (redirect page) (← links)
- Rank subcodes in multicomponent network coding (Q361696) (← links)
- Decoding of random network codes (Q764085) (← links)
- Properties of subspace subcodes of Gabidulin codes (Q935617) (← links)
- Modeling hexagonal constellations with Eisenstein-Jacobi graphs (Q950704) (← links)
- Quotients of Gaussian graphs and their application to perfect codes (Q975827) (← links)
- Attacks and counter-attacks on the GPT public key cryptosystem (Q1009035) (← links)
- Error and erasure correcting algorithms for rank codes (Q1009077) (← links)
- (Q1071730) (redirect page) (← links)
- Theory of codes with maximum rank distance (Q1071731) (← links)
- Perfect codes for metrics generated by primitive 2-error-correcting binary BCH codes (Q1582952) (← links)
- (Q1743309) (redirect page) (← links)
- Anonymous coherent network coding against eavesdropping and jamming (Q1743310) (← links)
- Column scrambler for the GPT cryptosystem (Q1811105) (← links)
- New sequences with zero autocorrelation (Q1812366) (← links)
- Bounds on the cardinality of subspace codes with non-maximum code distance (Q2068654) (← links)
- Algebraic codes for network coding (Q2269364) (← links)
- A new method for ensuring anonymity and security in network coding (Q2355666) (← links)
- Multicomponent codes with maximum code distance (Q2364473) (← links)
- Symmetric rank codes (Q2388475) (← links)
- Modified Niederreiter type of GPT cryptosystem based on reducible rank codes (Q2436558) (← links)
- Codes in the Vandermonde \(\mathcal F\)-metric and their application (Q2487085) (← links)
- Symmetric matrices and codes correcting rank errors beyond the \(\lfloor(d-1)/2 \rfloor\) bound (Q2489925) (← links)
- (Q2741406) (← links)
- (Q2741450) (← links)
- Linear codes with covering radius 2 and other new covering codes (Q3199331) (← links)
- Reducible rank codes and their applications to cryptography (Q3546907) (← links)
- Unimodular Perfect Sequences of Length<tex>$p^s$</tex> (Q3546908) (← links)
- Maximum rank distance codes as space~time codes (Q3547322) (← links)
- Perfect Codes for Metrics Induced by Circulant Graphs (Q3548883) (← links)
- (Q3753923) (← links)
- (Q4037491) (← links)
- (Q4108234) (← links)
- (Q4128679) (← links)
- Metrics generated by families of subspaces (Q4400366) (← links)
- (Q4404122) (← links)
- (Q4500997) (← links)
- On the Newton and covering radii of linear codes (Q4503452) (← links)
- Modeling Toroidal Networks with the Gaussian Integers (Q4564058) (← links)
- How to avoid the Sidel'nikov-Shestakov attack (Q4637800) (← links)
- Codes that correct two-dimensional burst errors (Q4637804) (← links)
- (Q4664671) (← links)
- (Q4665031) (← links)
- (Q4886141) (← links)
- Perfect Codes From Cayley Graphs Over Lipschitz Integers (Q4975954) (← links)
- (Q5219847) (← links)
- (Q5677385) (← links)
- Coding and Cryptography (Q5899173) (← links)
