Results 31 to 40 of about 178,102 (268)
Self-Orthogonal Codes From p-Divisible Codes
IEEE Transactions on Information Theory61 ...
Xiaoru Li, Ziling Heng
openaire +3 more sources
Optimal Linear Codes and Their Hulls
MathematicsThe hull of a linear code C is the intersection of C with its dual code. The goal is to study the dimensions of the hulls of optimal binary and ternary linear codes for a given length and dimension.
Stefka Bouyuklieva +1 more
doaj +1 more source
Asymptotic bound on binary self-orthogonal codes [PDF]
Science in China Series A: Mathematics, 2009 We present two constructions for binary self-orthogonal codes. It turns out that our constructions yield a constructive bound on binary self-orthogonal codes. In particular, when the information rate R=1/2, by our constructive lower bound, the relative minimum distance \approx 0.0595 (for GV bound, \approx 0.110).
openaire +3 more sources
Symbol and Bit Error Rates Analysis of Hybrid PIM-CDMA
EURASIP Journal on Wireless Communications and Networking, 2005 A hybrid pulse interval modulation code-division multiple-access (hPIM-CDMA) scheme employing the strict optical orthogonal code (SOCC) with unity and auto- and cross-correlation constraints for indoor optical wireless communications is proposed. In this
Ghassemlooy Z., See C. K.
doaj +2 more sources
Quantum codes from algebraic curves with automorphisms
Condensed Matter Physics, 2008 Let Χ be an algebraic curve of genus g ≥ 2 defined over a field Fq of characteristic p > 0. From Χ, under certain conditions, we can construct an algebraic geometry code C.
T.Shaska
doaj +1 more source
A Class of Quantum LDPC Codes Constructed From Finite Geometries
, 2008 Low-density parity check (LDPC) codes are a significant class of classical codes with many applications. Several good LDPC codes have been constructed using random, algebraic, and finite geometries approaches, with containing cycles of length at least ...
Aly, Salah A.
core +1 more source
Constructions of optimal LCD codes over large finite fields
, 2017 In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes.
Shi, Minjia, Sok, Lin, Solé, Patrick
core +2 more sources
Symplectic Self-Orthogonal Quasi-Cyclic Codes
IEEE Transactions on Information TheoryThis paper was published in IEEE TIT. In this version, we have corrected some minor errors, among which the most significant change is that the constraint $\gcd(\bar{f}_0(x),g(x))=1$ in Theorem 5 has been corrected to $\gcd(f_0(x),g(x))=1$
Chaofeng Guan +3 more
openaire +2 more sources
FEBS Open Bio, EarlyView.What factors make for an effective digital learning tool in Higher Education? This systematic review identifies elements of a digital tool that published examples reveal to be features of an engaging and impactful digital tool. A systematic literature search yielded 25 research papers for analysis.
Akmal Arzeman +4 more
wiley +1 more source
A Class of Binary Codes Using a Specific Automorphism Group
MathematicsIn this article, we showcase PSL(3,4) as the automorphism group for a specific class of three linear binary codes, C1, C2 and C3, with dimension 9. The demonstration involves leveraging the action of the group PSL(3,4), represented by invertible matrices
Driss Harzalla
doaj +1 more source