نتایج جستجو برای: minimum distance

تعداد نتایج: 392171  

Journal: :IEEE Transactions on Information Theory 1993

Journal: :IEEE Transactions on Information Theory 2022

We give a construction of quantum LDPC codes dimension $\Theta(\log N)$ and distance $\Theta(N/\log as the code length $N\to\infty$. Using product chain complexes this also provides family $\Omega(N^{1-\alpha/2}/\log $\Omega(N^\alpha \log N)$, where $0 \le \alpha < 1$. introduce study new operation called lifted product, which naturally generalizes operations for complexes. Moreover, simple byp...

Journal: :Linear Algebra and its Applications 1990

Journal: :Journal of Computational and Applied Mathematics 2009

Journal: :IEEE Transactions on Signal Processing 2011

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید