some recent developments in the theory of linear mrd codes
play

Some recent developments in the theory of linear MRD-codes Olga - PowerPoint PPT Presentation

Feb 07, 2023 •200 likes •1.92k views

Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Some recent developments in the theory of linear MRD-codes Olga Polverino Universit degli Studi della Campania,

  1. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Equivalence of RD-codes C , C ′ ⊂ F m × n linear RD-codes q C , C ′ equivalent C ′ = { AC σ B : C ∈ C} A ∈ GL ( m , F q ) , B ∈ GL ( n , F q ) and σ ∈ Aut ( F q ) Aut ( C ) Automorphism group of C Aut ( C ) = { ( A , B , σ ) ∈ GL ( m , q ) × GL ( n , q ) × Aut ( F q ) : A C σ B = C}

  2. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Left and Right idealiser of RD-codes linear RD-code in F m × n C q

  3. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Left and Right idealiser of RD-codes linear RD-code in F m × n C q L ( C ) = { Y ∈ F m × m : YC ∈ C for all C ∈ C} q Left idealiser of C

  4. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Left and Right idealiser of RD-codes linear RD-code in F m × n C q L ( C ) = { Y ∈ F m × m : YC ∈ C for all C ∈ C} q Left idealiser of C R ( C ) = { Z ∈ F n × n : CZ ∈ C for all C ∈ C} q Right idealiser of C

  5. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Left and Right idealiser of RD-codes linear RD-code in F m × n C q L ( C ) = { Y ∈ F m × m : YC ∈ C for all C ∈ C} q Left idealiser of C R ( C ) = { Z ∈ F n × n : CZ ∈ C for all C ∈ C} q Right idealiser of C D. Liebhold, G. Nebe : Automorphism groups of Gabidulin-like codes. Arch. Math. (2016)

  6. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Left and Right idealiser of RD-codes linear RD-code in F m × n C q L ( C ) = { Y ∈ F m × m : YC ∈ C for all C ∈ C} q Left idealiser of C R ( C ) = { Z ∈ F n × n : CZ ∈ C for all C ∈ C} q Right idealiser of C L ( C ) ∗ × R ( C ) ∗ × { id } ⊆ Aut ( C ) D. Liebhold, G. Nebe : Automorphism groups of Gabidulin-like codes. Arch. Math. (2016)

  7. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Left and Right idealiser of MRD-codes Lunardon-Trombetti-Zhou 2017, JACO

  8. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Left and Right idealiser of MRD-codes Lunardon-Trombetti-Zhou 2017, JACO For two equivalent linear metric codes their right (resp. left) idealisers are also equivalent.

  9. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Left and Right idealiser of MRD-codes Lunardon-Trombetti-Zhou 2017, JACO For two equivalent linear metric codes their right (resp. left) idealisers are also equivalent. Let C be a linear MRD code in F m × n with d > 1. q If m ≤ n then L ( C ) is a finite field. Hence | L ( C ) | ≤ q m . If n ≤ m then R ( C ) is a finite field. Hence | R ( C ) | ≤ q n .

  10. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Left and Right idealiser of MRD-codes Lunardon-Trombetti-Zhou 2017, JACO For two equivalent linear metric codes their right (resp. left) idealisers are also equivalent. Let C be a linear MRD code in F m × n with d > 1. q If m ≤ n then L ( C ) is a finite field. Hence | L ( C ) | ≤ q m . If n ≤ m then R ( C ) is a finite field. Hence | R ( C ) | ≤ q n . If C is a linear MRD code in F n × n with d > 1 then the left q and the right idealisers of C are both finite fields.

  11. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Left and Right idealiser of MRD-codes Lunardon-Trombetti-Zhou 2017, JACO For two equivalent linear metric codes their right (resp. left) idealisers are also equivalent. Let C be a linear MRD code in F m × n with d > 1. q If m ≤ n then L ( C ) is a finite field. Hence | L ( C ) | ≤ q m . If n ≤ m then R ( C ) is a finite field. Hence | R ( C ) | ≤ q n . If C is a linear MRD code in F n × n with d > 1 then the left q and the right idealisers of C are both finite fields.

  12. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Left and Right idealiser of MRD-codes Lunardon-Trombetti-Zhou 2017, JACO For two equivalent linear metric codes their right (resp. left) idealisers are also equivalent. Let C be a linear MRD code in F m × n with d > 1. q If m ≤ n then L ( C ) is a finite field. Hence | L ( C ) | ≤ q m . If n ≤ m then R ( C ) is a finite field. Hence | R ( C ) | ≤ q n . If C is a linear MRD code in F n × n with d > 1 then the left q and the right idealisers of C are both finite fields. dim L ( C ) ( C ) dim R ( C ) ( C )

  13. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim First Examples of linear MRD-codes P. Delsarte : Bilinear forms over a finite field, with applications to coding theory, J. Comb. Theory Ser. A (1978)

  14. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim First Examples of linear MRD-codes P. Delsarte : Bilinear forms over a finite field, with applications to coding theory, J. Comb. Theory Ser. A (1978) E. Gabidulin : Theory of codes with maximum rank distance, Probl. Inf. Transm. (1985)

  15. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim First Examples of linear MRD-codes P. Delsarte : Bilinear forms over a finite field, with applications to coding theory, J. Comb. Theory Ser. A (1978) E. Gabidulin : Theory of codes with maximum rank distance, Probl. Inf. Transm. (1985) A. Kshevetskiy, E. Gabidulin : The new construction of rank codes, Proceedings ISIT, (2005)

  16. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Gabidulin MRD-codes G k = { f ( x ) = a 0 x + a 1 x q + . . . a k − 1 x q ( k − 1 ) : a 0 , a 1 , . . . , a k − 1 ∈ F q n } , n , k ∈ Z + k < n

  17. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Gabidulin MRD-codes G k = { f ( x ) = a 0 x + a 1 x q + . . . a k − 1 x q ( k − 1 ) : a 0 , a 1 , . . . , a k − 1 ∈ F q n } , n , k ∈ Z + k < n dim F q Ker f ≤ k − 1

  18. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Gabidulin MRD-codes G k = { f ( x ) = a 0 x + a 1 x q + . . . a k − 1 x q ( k − 1 ) : a 0 , a 1 , . . . , a k − 1 ∈ F q n } , n , k ∈ Z + k < n dim F q Ker f ≤ k − 1 ⇒ dim F q Im f ≥ n − k + 1

  19. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Gabidulin MRD-codes G k = { f ( x ) = a 0 x + a 1 x q + . . . a k − 1 x q ( k − 1 ) : a 0 , a 1 , . . . , a k − 1 ∈ F q n } , n , k ∈ Z + k < n dim F q Ker f ≤ k − 1 ⇒ dim F q Im f ≥ n − k + 1 M f ∈ F n × n B → F q -basis of F q n q matrix associated with f w.r.t. B

  20. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Gabidulin MRD-codes G k = { f ( x ) = a 0 x + a 1 x q + . . . a k − 1 x q ( k − 1 ) : a 0 , a 1 , . . . , a k − 1 ∈ F q n } , n , k ∈ Z + k < n dim F q Ker f ≤ k − 1 ⇒ dim F q Im f ≥ n − k + 1 M f ∈ F n × n B → F q -basis of F q n q matrix associated with f w.r.t. B C G k = { M f : f ∈ G k } ⊆ F n × n , q

  21. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Gabidulin MRD-codes G k = { f ( x ) = a 0 x + a 1 x q + . . . a k − 1 x q ( k − 1 ) : a 0 , a 1 , . . . , a k − 1 ∈ F q n } , n , k ∈ Z + k < n dim F q Ker f ≤ k − 1 ⇒ dim F q Im f ≥ n − k + 1 M f ∈ F n × n B → F q -basis of F q n q matrix associated with f w.r.t. B C G k = { M f : f ∈ G k } ⊆ F n × n , q C G k Gabidulin MRD-code [ n × n , kn , n − k + 1 ] F q

  22. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Gabidulin MRD-codes G k = { f ( x ) = a 0 x + a 1 x q + · · · + a k − 1 x q ( k − 1 ) : a 0 , a 1 , . . . , a k − 1 ∈ F q n } , n , k ∈ Z + k < n

  23. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Gabidulin MRD-codes G k = { f ( x ) = a 0 x + a 1 x q + · · · + a k − 1 x q ( k − 1 ) : a 0 , a 1 , . . . , a k − 1 ∈ F q n } , n , k ∈ Z + k < n U ⊆ F q n , dim F q U = m ≤ n , B U basis of U

  24. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Gabidulin MRD-codes G k = { f ( x ) = a 0 x + a 1 x q + · · · + a k − 1 x q ( k − 1 ) : a 0 , a 1 , . . . , a k − 1 ∈ F q n } , n , k ∈ Z + k < n U ⊆ F q n , dim F q U = m ≤ n , B U basis of U C G k ( U ) = { M f | U : f ∈ G k } ⊆ F n × m , q

  25. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Gabidulin MRD-codes G k = { f ( x ) = a 0 x + a 1 x q + · · · + a k − 1 x q ( k − 1 ) : a 0 , a 1 , . . . , a k − 1 ∈ F q n } , n , k ∈ Z + k < n U ⊆ F q n , dim F q U = m ≤ n , B U basis of U C G k ( U ) = { M f | U : f ∈ G k } ⊆ F n × m , q C G k ( U ) Gabidulin MRD-code [ n × m , kn , n − k + 1 ] F q

  26. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Gabidulin MRD-codes G k = { f ( x ) = a 0 x + a 1 x q + · · · + a k − 1 x q ( k − 1 ) : a 0 , a 1 , . . . , a k − 1 ∈ F q n } , n , k ∈ Z + k < n U ⊆ F q n , dim F q U = m ≤ n , B U basis of U C G k ( U ) = { M f | U : f ∈ G k } ⊆ F n × m , q C G k ( U ) Gabidulin MRD-code [ n × m , kn , n − k + 1 ] F q C G k ( U ) T Gabidulin MRD-code [ m × n , kn , n − k + 1 ] F q

  27. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Generalised Gabidulin MRD-codes G k , s = { f ( x ) = a 0 x + a 1 x q s + · · · + a k − 1 x q s ( k − 1 ) : a 0 , a 1 , . . . , a k − 1 ∈ F q n } , n , k , s ∈ Z + , k < n , gcd ( n , s ) = 1

  28. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Generalised Gabidulin MRD-codes G k , s = { f ( x ) = a 0 x + a 1 x q s + · · · + a k − 1 x q s ( k − 1 ) : a 0 , a 1 , . . . , a k − 1 ∈ F q n } , n , k , s ∈ Z + , k < n , gcd ( n , s ) = 1 C G k , s = { M f : f ∈ G k } ⊆ F n × n , q

  29. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Generalised Gabidulin MRD-codes G k , s = { f ( x ) = a 0 x + a 1 x q s + · · · + a k − 1 x q s ( k − 1 ) : a 0 , a 1 , . . . , a k − 1 ∈ F q n } , n , k , s ∈ Z + , k < n , gcd ( n , s ) = 1 C G k , s = { M f : f ∈ G k } ⊆ F n × n , q C G k , s Generalised Gabidulin MRD-code [ n × n , kn , n − k + 1 ] F q

  30. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Generalised Gabidulin MRD-codes G k , s = { f ( x ) = a 0 x + a 1 x q s + · · · + a k − 1 x q s ( k − 1 ) : a 0 , a 1 , . . . , a k − 1 ∈ F q n } , n , k , s ∈ Z + , k < n , gcd ( n , s ) = 1 C G k , s = { M f : f ∈ G k } ⊆ F n × n , q C G k , s Generalised Gabidulin MRD-code [ n × n , kn , n − k + 1 ] F q C G k , s ( U ) Generalised Gabidulin MRD-code [ n × m , kn , n − k + 1 ] F q C G k , s ( U ) T Generalised Gabidulin MRD-code [ m × n , kn , n − k + 1 ] F q

  31. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Linearized polynomials F n × n q

  32. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Linearized polynomials F n × n q ↓ End ( F q n , F q )

  33. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Linearized polynomials F n × n q ↓ End ( F q n , F q ) ↓ L n , q = { f ( x ) = a 0 x + a 1 x q + . . . a n − 1 x q ( n − 1 ) : a 0 , a 1 , . . . , a n − 1 ∈ F q n }

  34. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Linearized polynomials F n × n q ↓ End ( F q n , F q ) ↓ L n , q = { f ( x ) = a 0 x + a 1 x q + . . . a n − 1 x q ( n − 1 ) : a 0 , a 1 , . . . , a n − 1 ∈ F q n } ( F n × n ( L n , q , + , ◦ ) ≃ , + , · ) q

  35. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Linearized polynomials F n × n q ↓ End ( F q n , F q ) ↓ L n , q = { f ( x ) = a 0 x + a 1 x q + . . . a n − 1 x q ( n − 1 ) : a 0 , a 1 , . . . , a n − 1 ∈ F q n } ( F n × n ( L n , q , + , ◦ ) ≃ , + , · ) q composition modulo x q n − x ◦ →

  36. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Linearized polynomials C , C ′ ⊆ L n , q equivalent MRD-codes

  37. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Linearized polynomials C , C ′ ⊆ L n , q equivalent MRD-codes C ′ = { g ◦ f σ ◦ h : f ∈ C} f , g permutation q -polynomials, σ ∈ Aut ( F q )

  38. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Linearized polynomials C , C ′ ⊆ L n , q equivalent MRD-codes C ′ = { g ◦ f σ ◦ h : f ∈ C} f , g permutation q -polynomials, σ ∈ Aut ( F q ) C ⊆ L n , q MRD-code

  39. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Linearized polynomials C , C ′ ⊆ L n , q equivalent MRD-codes C ′ = { g ◦ f σ ◦ h : f ∈ C} f , g permutation q -polynomials, σ ∈ Aut ( F q ) C ⊆ L n , q MRD-code L ( C ) = { g ∈ L n , q : g ◦ f ∈ C for all f ∈ C} Left idealiser of C

  40. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Linearized polynomials C , C ′ ⊆ L n , q equivalent MRD-codes C ′ = { g ◦ f σ ◦ h : f ∈ C} f , g permutation q -polynomials, σ ∈ Aut ( F q ) C ⊆ L n , q MRD-code L ( C ) = { g ∈ L n , q : g ◦ f ∈ C for all f ∈ C} Left idealiser of C R ( C ) = { h ∈ L n , q : f ◦ h ∈ C for all f ∈ C} Right idealiser of C

  41. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Linearized polynomials G k , s = { f ( x ) = a 0 x + a 1 x q s + . . . a k − 1 x q s ( k − 1 ) : a 0 , a 1 , . . . , a k − 1 ∈ F q n } n , k , s ∈ Z + , k < n , gcd ( n , s ) = 1 G k , s Generalised Gabidulin MRD-code [ n × n , kn , n − k + 1 ] F q

  42. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Linearized polynomials G k , s = { f ( x ) = a 0 x + a 1 x q s + . . . a k − 1 x q s ( k − 1 ) : a 0 , a 1 , . . . , a k − 1 ∈ F q n } n , k , s ∈ Z + , k < n , gcd ( n , s ) = 1 G k , s Generalised Gabidulin MRD-code [ n × n , kn , n − k + 1 ] F q

  43. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Linearized polynomials G k , s = { f ( x ) = a 0 x + a 1 x q s + . . . a k − 1 x q s ( k − 1 ) : a 0 , a 1 , . . . , a k − 1 ∈ F q n } n , k , s ∈ Z + , k < n , gcd ( n , s ) = 1 G k , s Generalised Gabidulin MRD-code [ n × n , kn , n − k + 1 ] F q F q n = { τ α ( x ) = α x : α ∈ F q n }

  44. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Linearized polynomials G k , s = { f ( x ) = a 0 x + a 1 x q s + . . . a k − 1 x q s ( k − 1 ) : a 0 , a 1 , . . . , a k − 1 ∈ F q n } n , k , s ∈ Z + , k < n , gcd ( n , s ) = 1 G k , s Generalised Gabidulin MRD-code [ n × n , kn , n − k + 1 ] F q F q n = { τ α ( x ) = α x : α ∈ F q n } f ◦ τ α ∈ G k , s , τ α ◦ f ∈ G k , s for all f ∈ G k , s , τ α ∈ F q n

  45. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Linearized polynomials G k , s = { f ( x ) = a 0 x + a 1 x q s + . . . a k − 1 x q s ( k − 1 ) : a 0 , a 1 , . . . , a k − 1 ∈ F q n } n , k , s ∈ Z + , k < n , gcd ( n , s ) = 1 G k , s Generalised Gabidulin MRD-code [ n × n , kn , n − k + 1 ] F q F q n = { τ α ( x ) = α x : α ∈ F q n } f ◦ τ α ∈ G k , s , τ α ◦ f ∈ G k , s for all f ∈ G k , s , τ α ∈ F q n L ( G k , s ) = F q n R ( G k , s ) = F q n

  46. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Linearized polynomials G k , s = { f ( x ) = a 0 x + a 1 x q s + . . . a k − 1 x q s ( k − 1 ) : a 0 , a 1 , . . . , a k − 1 ∈ F q n } n , k , s ∈ Z + , k < n , gcd ( n , s ) = 1 G k , s Generalised Gabidulin MRD-code [ n × n , kn , n − k + 1 ] F q F q n = { τ α ( x ) = α x : α ∈ F q n } f ◦ τ α ∈ G k , s , τ α ◦ f ∈ G k , s for all f ∈ G k , s , τ α ∈ F q n L ( G k , s ) = F q n R ( G k , s ) = F q n

  47. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Linearized polynomials G k , s = { f ( x ) = a 0 x + a 1 x q s + . . . a k − 1 x q s ( k − 1 ) : a 0 , a 1 , . . . , a k − 1 ∈ F q n } n , k , s ∈ Z + , k < n , gcd ( n , s ) = 1 G k , s Generalised Gabidulin MRD-code [ n × n , kn , n − k + 1 ] F q F q n = { τ α ( x ) = α x : α ∈ F q n } f ◦ τ α ∈ G k , s , τ α ◦ f ∈ G k , s for all f ∈ G k , s , τ α ∈ F q n L ( G k , s ) = F q n R ( G k , s ) = F q n G k , s F q n -linear MRD-code

  48. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Finite presemifields J. De La Cruz, Kiermaier, Wassermann, Willem : Algebraic structures of MRD codes, Adv. Math. Commun. (2016)

  49. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Finite presemifields J. De La Cruz, Kiermaier, Wassermann, Willem : Algebraic structures of MRD codes, Adv. Math. Commun. (2016) J. Sheekey: A new family of linear maximum rank distance codes, Adv. Math. Commun. (2016)

  50. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Finite presemifields J. De La Cruz, Kiermaier, Wassermann, Willem : Algebraic structures of MRD codes, Adv. Math. Commun. (2016) J. Sheekey: A new family of linear maximum rank distance codes, Adv. Math. Commun. (2016) C F q -linear MRD-code, [ n × n , n , n ] F q � S C presemifield of order q n with left nucleus containing F q

  51. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Finite presemifields J. De La Cruz, Kiermaier, Wassermann, Willem : Algebraic structures of MRD codes, Adv. Math. Commun. (2016) J. Sheekey: A new family of linear maximum rank distance codes, Adv. Math. Commun. (2016) C F q -linear MRD-code, [ n × n , n , n ] F q � π S C semifield plane of order q n

  52. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Finite presemifields J. De La Cruz, Kiermaier, Wassermann, Willem : Algebraic structures of MRD codes, Adv. Math. Commun. (2016) J. Sheekey: A new family of linear maximum rank distance codes, Adv. Math. Commun. (2016) C F q -linear MRD-code, [ n × n , n , n ] F q � π S C semifield plane of order q n G 1 , s → S G 1 , s isotopic to F q n

  53. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Finite presemifields J. De La Cruz, Kiermaier, Wassermann, Willem : Algebraic structures of MRD codes, Adv. Math. Commun. (2016) J. Sheekey: A new family of linear maximum rank distance codes, Adv. Math. Commun. (2016) C F q -linear MRD-code, [ n × n , n , n ] F q � π S C semifield plane of order q n G 1 , s → π S G 1 , s Desarguesian plane

  54. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Generalized Twisted Gabidulin Codes Sheekey, 2016 H k , s ( η, h ) = { f ( x ) = a 0 x + a 1 x q s + · · · + a k − 1 x q s ( k − 1 ) + η a q h 0 x q sk : a i ∈ F q n } n , k , s ∈ Z + , N q ( η ) � = ( − 1 ) nk k < n , gcd ( n , s ) = 1,

  55. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Generalized Twisted Gabidulin Codes Sheekey, 2016 H k , s ( η, h ) = { f ( x ) = a 0 x + a 1 x q s + · · · + a k − 1 x q s ( k − 1 ) + η a q h 0 x q sk : a i ∈ F q n } n , k , s ∈ Z + , N q ( η ) � = ( − 1 ) nk k < n , gcd ( n , s ) = 1,

  56. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Generalized Twisted Gabidulin Codes Sheekey, 2016 H k , s ( η, h ) = { f ( x ) = a 0 x + a 1 x q s + · · · + a k − 1 x q s ( k − 1 ) + η a q h 0 x q sk : a i ∈ F q n } n , k , s ∈ Z + , N q ( η ) � = ( − 1 ) nk k < n , gcd ( n , s ) = 1, H k , s ( η, h ) MRD-code [ n × n , kn , n − k + 1 ] F q

  57. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Generalized Twisted Gabidulin Codes Sheekey, 2016 H k , s ( η, h ) = { f ( x ) = a 0 x + a 1 x q s + · · · + a k − 1 x q s ( k − 1 ) + η a q h 0 x q sk : a i ∈ F q n } n , k , s ∈ Z + , N q ( η ) � = ( − 1 ) nk k < n , gcd ( n , s ) = 1, H k , s ( η, h ) MRD-code [ n × n , kn , n − k + 1 ] F q H k , s ( 0 , h ) = G k , s

  58. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Generalized Twisted Gabidulin Codes Sheekey, 2016 H k , s ( η, h ) = { f ( x ) = a 0 x + a 1 x q s + · · · + a k − 1 x q s ( k − 1 ) + η a q h 0 x q sk : a i ∈ F q n } n , k , s ∈ Z + , N q ( η ) � = ( − 1 ) nk k < n , gcd ( n , s ) = 1, H k , s ( η, h ) MRD-code [ n × n , kn , n − k + 1 ] F q H k , s ( 0 , h ) = G k , s a 0 x + η a q h 0 x q s H 1 , s ( η, h ) → Generalized twisted field

  59. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Generalized Twisted Gabidulin Codes Sheekey, 2016 H k , s ( η, h ) = { f ( x ) = a 0 x + a 1 x q s + · · · + a k − 1 x q s ( k − 1 ) + η a q h 0 x q sk : a i ∈ F q n } n , k , s ∈ Z + , N q ( η ) � = ( − 1 ) nk k < n , gcd ( n , s ) = 1, H k , s ( η, h ) MRD-code [ n × n , kn , n − k + 1 ] F q H k , s ( 0 , h ) = G k , s a 0 x + η a q h 0 x q s H 1 , s ( η, h ) → Generalized twisted field H 2 ( η, 1 ) K. Otal, F. Özbudak : Explicit Construction of Some Non-Gabidulin Linear Maximum Rank Distance Codes, Adv. Math. Commun. (2016)

  60. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Generalized Twisted Gabidulin Codes Sheekey 2016/ Lunardon-Trombetti-Zhou, ArXiv (2015)

  61. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Generalized Twisted Gabidulin Codes Sheekey 2016/ Lunardon-Trombetti-Zhou, ArXiv (2015) If η � = 0, then H k , s ( η, h ) �≃ G k , s unless k ∈ { 1 , n − 1 } and h ∈ { 0 , 1 } .

  62. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Generalized Twisted Gabidulin Codes Sheekey 2016/ Lunardon-Trombetti-Zhou, ArXiv (2015) If η � = 0, then H k , s ( η, h ) �≃ G k , s unless k ∈ { 1 , n − 1 } and h ∈ { 0 , 1 } . Lunardon-Trombetti-Zhou (2017),JACO

  63. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Generalized Twisted Gabidulin Codes Sheekey 2016/ Lunardon-Trombetti-Zhou, ArXiv (2015) If η � = 0, then H k , s ( η, h ) �≃ G k , s unless k ∈ { 1 , n − 1 } and h ∈ { 0 , 1 } . Lunardon-Trombetti-Zhou (2017),JACO H k , s ( η, h )

  64. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Generalized Twisted Gabidulin Codes Sheekey 2016/ Lunardon-Trombetti-Zhou, ArXiv (2015) If η � = 0, then H k , s ( η, h ) �≃ G k , s unless k ∈ { 1 , n − 1 } and h ∈ { 0 , 1 } . Lunardon-Trombetti-Zhou (2017),JACO H k , s ( η, h ) If η = 0, then H k , s ( 0 , h ) = G k , s and L ( G k , s ) = R ( G k , s ) ≃ F q n .

  65. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Generalized Twisted Gabidulin Codes Sheekey 2016/ Lunardon-Trombetti-Zhou, ArXiv (2015) If η � = 0, then H k , s ( η, h ) �≃ G k , s unless k ∈ { 1 , n − 1 } and h ∈ { 0 , 1 } . Lunardon-Trombetti-Zhou (2017),JACO H k , s ( η, h ) If η = 0, then H k , s ( 0 , h ) = G k , s and L ( G k , s ) = R ( G k , s ) ≃ F q n . If η � = 0 and 1 < k < n − 1, then L ( H k , s ( η, h )) ≃ F q gcd ( n , h ) and R ( H k , s ( η, h )) ≃ F q gcd ( n , sk − h ) .

  66. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Subfamilies of H H = {H k , s ( η, h ) ⊆ L n , q }

  67. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Subfamilies of H H = {H k , s ( η, h ) ⊆ L n , q } G = {G k , s ⊆ L n , q }

  68. Linear MRD-codes Generalized Gabidulin Codes and linearized polynomials Generalized Twisted Gabidulin Codes MRD-codes-Maxim Subfamilies of H H = {H k , s ( η, h ) ⊆ L n , q } G = {G k , s ⊆ L n , q } H L = {C ∈ H : L ( C ) ≃ F q n } H R = {C ∈ H : R ( C ) ≃ F q n }

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

LCD codes over F q are as good as linear codes for q at least four Ruud Pellikaan

LCD codes over F q are as good as linear codes for q at least four Ruud Pellikaan

LCD codes over F q are as good as linear codes for q at least four Ruud Pellikaan g.r.pellikaan@tue.nl International Conference on Graph Theory and Information Security ICGTIS, August 7, 2017 Universitas Indonesia, Depok, Indonesia Faculteit

537 views • 35 slides
Recent Advances in Decoding Random Binary Linear Codes and Their Implications to Crypto

Recent Advances in Decoding Random Binary Linear Codes and Their Implications to Crypto

Recent Advances in Decoding Random Binary Linear Codes and Their Implications to Crypto Alexander May Horst Grtz Institute for IT-Security Faculty of Mathematics Ruhr-University of Bochum L ATTICE C ODING AND C RYPTO M EETING M AY 2017,

793 views • 32 slides
Information Theory Lecture 6 Block Codes and Finite Fields Codes: Roth (R) 12, 4.14

Information Theory Lecture 6 Block Codes and Finite Fields Codes: Roth (R) 12, 4.14

Information Theory Lecture 6 Block Codes and Finite Fields Codes: Roth (R) 12, 4.14 codes, minimum distance, linear codes, G and H matrices, decoding, bounds, weight distribution,. . . Finite fields: R3 (R7) groups,

911 views • 9 slides
Information Theory Lecture 8 BCH codes BCH codes: R8.45 (R5.6) Decoding BCH (and

Information Theory Lecture 8 BCH codes BCH codes: R8.45 (R5.6) Decoding BCH (and

Information Theory Lecture 8 BCH codes BCH codes: R8.45 (R5.6) Decoding BCH (and RS) codes: R6 Reed-Solomon codes RS codes: R5.13 Mikael Skoglund, Information Theory 1/15 The BCH Bound Theorem : Let C be cyclic of

276 views • 8 slides
Recent DHCAL Developments Jos Repond and Lei Xia Argonne National Laboratory Linear Collider

Recent DHCAL Developments Jos Repond and Lei Xia Argonne National Laboratory Linear Collider

Recent DHCAL Developments Jos Repond and Lei Xia Argonne National Laboratory Linear Collider Workshop 2013 University of Tokyo November 11 15, 2013 The DHCAL Description 54 active layers Resistive Plate Chambers with 1 x 1 cm 2 pads

424 views • 23 slides
Loewner Theory in Annulus: history and recent developments P avel G umenyuk Institut

Loewner Theory in Annulus: history and recent developments P avel G umenyuk Institut

Univalent functions and control W orkshop dedicated to 65 th A nniversary of P rofessor D mitri V alentinovich P rokhorov Loewner Theory in Annulus: history and recent developments P avel G umenyuk Institut Mittag-Leffler Djursholm,

647 views • 32 slides
Hand arm Vibration &amp; Hand-arm Vibration &amp; Recent Developments Recent Developments

Hand arm Vibration &amp; Hand-arm Vibration &amp; Recent Developments Recent Developments

Hand arm Vibration &amp; Hand-arm Vibration &amp; Recent Developments Recent Developments Stuart McGregor &amp; Bruce Appleton Noise &amp; Vibration Specialists p Health &amp; Safety Executive What we are going to talk about What we are

415 views • 28 slides
Selection of recent theory and phenomenology developments in forward physics within high-energy

Selection of recent theory and phenomenology developments in forward physics within high-energy

Selection of recent theory and phenomenology developments in forward physics within high-energy factorization Piotr Kotko Institute of Nuclear Physics (Cracow) supported by LIDER/02/35/L-2/10/NCBiR/2011 based on A. van Hameren, P .K., K.

350 views • 14 slides
Macroeconomic Overview of India: Recent Trends and Developments Recent Trends and Developments

Macroeconomic Overview of India: Recent Trends and Developments Recent Trends and Developments

Macroeconomic Overview of India: Recent Trends and Developments Recent Trends and Developments Mathew Joseph Senior Consultant, ICRIER India-Taiwan Relations ICRIER-CIER Joint Feasibility Study New Delhi 1 7 January 2011 1 Structure 1. An

505 views • 18 slides
Recent developments in x-dependent structure calculations Chris Monahan Institute for Nuclear

Recent developments in x-dependent structure calculations Chris Monahan Institute for Nuclear

Recent developments in x-dependent structure calculations Chris Monahan Institute for Nuclear Theory University of Washington The motivation Dominant theory uncertainty: W mass Higgs couplings Searches for BSM particles Parton distribution

746 views • 73 slides
recent developments of approximation theory and greedy algorithms Peter Binev Department of

recent developments of approximation theory and greedy algorithms Peter Binev Department of

recent developments of approximation theory and greedy algorithms Peter Binev Department of Mathematics and Interdisciplinary Mathematics Institute University of South Carolina R educed O rder M odeling in G eneral R elativity Pasadena, CA

700 views • 48 slides
6.02 Fall 2012 Lecture #4 Linear block codes Rectangular codes Hamming codes 6.02 F

6.02 Fall 2012 Lecture #4 Linear block codes Rectangular codes Hamming codes 6.02 F

6.02 Fall 2012 Lecture #4 Linear block codes Rectangular codes Hamming codes 6.02 F all 2012 Lecture 4, Slide #1 Single Link Communication Model End-host Original source computers Receiving app/user Digitize Render/display,

246 views • 21 slides
Recent Economic Developments Recent Economic Developments January, 2 0 0 9 Published by

Recent Economic Developments Recent Economic Developments January, 2 0 0 9 Published by

REPUBLIC OF INDONESIA Recent Economic Developments Recent Economic Developments January, 2 0 0 9 Published by Investors Relations Unit Republic Indonesia Address Bank Indonesia International Directorate / Division of Foreign Debt Analysis

1.65k views • 115 slides
QcBits: constant-time small-key code-based cryptography Tung Chou Technische Universiteit

QcBits: constant-time small-key code-based cryptography Tung Chou Technische Universiteit

QcBits: constant-time small-key code-based cryptography Tung Chou Technische Universiteit Eindhoven, The Netherlands Coding theory 2 Coding theory Linear codes 2 Coding theory Linear codes a linear subspace in F N 2 2 Coding theory

1k views • 77 slides
Recent Developments in Analytic Bootstrap Annual Theory Meeting, Durham, 2017 Alexander

Recent Developments in Analytic Bootstrap Annual Theory Meeting, Durham, 2017 Alexander

Recent Developments in Analytic Bootstrap Annual Theory Meeting, Durham, 2017 Alexander Zhiboedov, Harvard U How do we compute when the coupling is strong? No small coupling expansion No Lagrangian No extra symmetries/integrability Bootstrap

645 views • 49 slides
Algorithms in the Real World Error Correcting Codes I Overview Hamming Codes Linear

Algorithms in the Real World Error Correcting Codes I Overview Hamming Codes Linear

Algorithms in the Real World Error Correcting Codes I Overview Hamming Codes Linear Codes Page 1 General Model message m Errors introduced by the noisy channel: coder changed fields in the codeword (e.g., a flipped bit)

307 views • 28 slides
A search for disappearance with: SciBooNE MiniBooNE and Kendall Mahn TRIUMF For the

A search for disappearance with: SciBooNE MiniBooNE and Kendall Mahn TRIUMF For the

A search for disappearance with: SciBooNE MiniBooNE and Kendall Mahn TRIUMF For the SciBooNE and MiniBooNE collabora&gt;ons 5/1/2011 0 Neutrino oscillations in 2011 Neutrino oscillations thus far are consistent with three flavors of

345 views • 16 slides
Multicast and Anycast Group Membership (MAGMA) IETF 57 Brian Haberman Isidor Kouvelas Agenda

Multicast and Anycast Group Membership (MAGMA) IETF 57 Brian Haberman Isidor Kouvelas Agenda

Multicast and Anycast Group Membership (MAGMA) IETF 57 Brian Haberman Isidor Kouvelas Agenda Agenda Bashing Chairs 5 min Document Status Chairs 15 min IGMP/MLD MIB Chairs 15 min Document Status MLDv2 Updated

463 views • 9 slides
Constructions for constant dimension codes Tao ( ) Feng ( ) Department of Mathematics Beijing

Constructions for constant dimension codes Tao ( ) Feng ( ) Department of Mathematics Beijing

Constructions for constant dimension codes Tao ( ) Feng ( ) Department of Mathematics Beijing Jiaotong University Joint work with Shuangqing Liu and Yanxun Chang July 1, 2019 1 / 71 Outline 1 Background and Definitions 2 Constructions for

1.03k views • 84 slides
A new family of maximum rank distance codes or: Maximum rank distance codes and finite semifields

A new family of maximum rank distance codes or: Maximum rank distance codes and finite semifields

A new family of maximum rank distance codes or: Maximum rank distance codes and finite semifields John Sheekey Universiteit Gent, Belgium Alcoma, March 2015 Rank metric codes A rank metric code is a set C M n ( F ) of n n matrices over

963 views • 92 slides
Modeling mountain building and the seismic cycle in the Himalaya of Nepal R. Cattin and J. P .

Modeling mountain building and the seismic cycle in the Himalaya of Nepal R. Cattin and J. P .

Modeling mountain building and the seismic cycle in the Himalaya of Nepal R. Cattin and J. P . Anouac 2016 y 5/30 M2 0. Outline

492 views • 38 slides
Rank Metric Codes and related Structures Yue Zhou July 5, 2017 The 2nd International Workshop on

Rank Metric Codes and related Structures Yue Zhou July 5, 2017 The 2nd International Workshop on

Rank Metric Codes and related Structures Yue Zhou July 5, 2017 The 2nd International Workshop on Boolean Functions and their Applications (BFA) Outline Introduction Maximum rank distance codes Quadratic bent-Negabent functions Vectorial

2.09k views • 179 slides
31 January 2015, Kavli IPMU, University of Tokyo, Kashiwa AMDG Our Lady, untier of knots N.B.

31 January 2015, Kavli IPMU, University of Tokyo, Kashiwa AMDG Our Lady, untier of knots N.B.

Mark Rayner (Universit de Genve) for TITUS 6th Open Meeting for the Hyper-Kamiokande Project 31 January 2015, Kavli IPMU, University of Tokyo, Kashiwa AMDG Our Lady, untier of knots N.B. Lots of work here by Etam Noah and Alain Blondel

649 views • 27 slides
Flow variability in the vicinity of a busy intersection in Central London A. Balogun, A.S.

Flow variability in the vicinity of a busy intersection in Central London A. Balogun, A.S.

Flow variability in the vicinity of a busy intersection in Central London A. Balogun, A.S. Tomlin, C. R. Wood, J. Barlow, S. Belcher, R. Smalley, J. Lingard, S. Arnold, A. Dobre, A. Robins, D. Martin and D. Shallcross Universities of Leeds,

276 views • 23 slides

More recommend