Linear time encodable binary code achieving GV bound with linear time encodable dual achieving GV bound

Documents similaires

• Infinitely many families of distance-optimal binary linear codes with respect to the sphere packing bound
  par: Chen, Hao, et autres
  Publié: (2025)
• New upper bounds on binary linear codes and a $\mathbb Z_4$-code with a better-than-linear Gray image
  par: Kiermaier, Michael, et autres
  Publié: (2015)
• On catastrophicity of convolutional codes and their encoders over $\Z_{p^r}$
  par: Oued, Mohammed El
  Publié: (2025)
• Four constructions of self-dual binary cyclic codes with a lower bound on the minimum distances better than the square-root bound
  par: Wang, Xiaoqiang, et autres
  Publié: (2026)
• Quasi-linear time decoding of RS and AG codes for burst errors up to the Singleton bound
  par: Li, Songsong, et autres
  Publié: (2025)