| تعداد نشریات | 32 |
| تعداد شمارهها | 607 |
| تعداد مقالات | 5,918 |
| تعداد مشاهده مقاله | 8,960,703 |
| تعداد دریافت فایل اصل مقاله | 6,555,946 |
Hypergroup Association Schemes and Linear Programming Bounds | ||
| Caspian Journal of Mathematical Sciences | ||
| مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 27 آبان 1405 | ||
| نوع مقاله: Research Articles | ||
| شناسه دیجیتال (DOI): 10.22080/cjms.2026.32368.1889 | ||
| نویسنده | ||
| Mohammad Ali Dehghanizadeh* | ||
| Department of Basic Sciences, Technical and Vocational University(TVU), tehran, Iran | ||
| تاریخ دریافت: 18 تیر 1405، تاریخ بازنگری: 08 مرداد 1405، تاریخ پذیرش: 10 مرداد 1405 | ||
| چکیده | ||
| This paper establishes a unified algebraic framework relating commutative hypergroup theory to the derivation of sharp linear programming (LP) bounds for error-correcting codes. By recasting classical association schemes as specialized commutative hypergroups, we generalize fundamental coding bounds and elucidate their underlying structural invariants. We leverage the character theory and spectral decomposition of convolution operators to formally derive the Generalized Hypergroup LP Bound, demonstrating its efficacy across varied distance constraints. A central contribution is the development of an optimality criterion that characterizes the attainability of these bounds, explicitly linking code optimality to the properties of dual distributions and hypergroup spectral invariants. Furthermore, we examine the influence of spectral gaps and structural stability on bound robustness under perturbations, extending our results to non-commutative fusion extensions and deformed hypergroup structures. This synthesis unifies classical results including the Delsarte-Lloyd, Plotkin, and standard LP bounds—within a coherent hypergroup-theoretic umbrella. We validate our framework through applications to Hamming, Johnson, and polynomial hypergroups. This work provides a rigorous algebraic foundation for coding theory, offering new avenues for constructing optimal codes and advancing the study of algebraic combinatorics and spectral methods in information theory. | ||
| کلیدواژهها | ||
| Hypergroups؛ Association Schemes؛ Coding Theory؛ Linear Programming Bounds؛ Harmonic | ||
|
آمار تعداد مشاهده مقاله: 0 |
||