✨
Yapay Zeka Hızlı Bakış & Çıkarımlar
AI Insight⚡ TL;DR(1 Cümlede Hızlı Çıkarım)
We also provide a new proof of the result that $2(1-\varepsilon) \gamma n$ is a lower bound of the minimum distance of the expander code given by an $(m,n,d,\gamma,1-\varepsilon)$ expander bipartite graph.
📌 3 Maddede Bu Makale
🎯
Amaç & Hipotez:An expander code is a binary linear code whose parity-check matrix is the bi-adjacency matrix of a bipartite expander graph.
📊
Temel Bulgular & Veri:We provide a new formula for the minimum distance of such codes.
💡
Sonuç & Katkı:We also provide a new proof of the result that $2(1-\varepsilon) \gamma n$ is a lower bound of the minimum distance of the expander code given by an $(m,n,d,\gamma,1-\varepsilon)$ expander bipartite graph.
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Linear code · Minimum distance · Expander graph
Abstract
An expander code is a binary linear code whose parity-check matrix is the bi-adjacency matrix of a bipartite expander graph. We provide a new formula for the minimum distance of such codes. We also provide a new proof of the result that $2(1-\varepsilon) \gamma n$ is a lower bound of the minimum distance of the expander code given by an $(m,n,d,\gamma,1-\varepsilon)$ expander bipartite graph.
Anahtar kelimeler
🔖
Bu Makaleye Atıf Yap
MALLİK, S. (2022). A new formula for the minimum distance of an expander code. Journal of Algebra Combinatorics Discrete Structures and Applications, Cilt: 9 - Sayı: 2, 9–14. https://ajindex.com/articles/861485