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

Documenti analoghi

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