simplex code
Recently Published Documents


TOTAL DOCUMENTS

12
(FIVE YEARS 4)

H-INDEX

3
(FIVE YEARS 1)

Author(s):  
J. Prabu ◽  
J. Mahalakshmi ◽  
C. Durairajan ◽  
S. Santhakumar

In this paper, we have constructed some new codes from [Formula: see text]-Simplex code called unit [Formula: see text]-Simplex code. In particular, we find the parameters of these codes and have proved that it is a [Formula: see text] [Formula: see text]-linear code, where [Formula: see text] and [Formula: see text] is a smallest prime divisor of [Formula: see text]. When rank [Formula: see text] and [Formula: see text] is a prime power, we have given the weight distribution of unit [Formula: see text]-Simplex code. For the rank [Formula: see text] we obtain the partial weight distribution of unit [Formula: see text]-Simplex code when [Formula: see text] is a prime power. Further, we derive the weight distribution of unit [Formula: see text]-Simplex code for the rank [Formula: see text] [Formula: see text].


Author(s):  
Matthias Grezet ◽  
Camilla Hollanti

Abstract This paper presents a new alphabet-dependent bound for codes with hierarchical locality. Then, the complete list of possible localities is derived for a class of codes obtained by deleting specific columns from a Simplex code. This list is used to show that these codes are optimal codes with hierarchical locality.


IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 215414-215418
Author(s):  
Qiang Fu ◽  
Ruihu Li ◽  
Sen Yang

2018 ◽  
Vol 420 ◽  
pp. 200-204 ◽  
Author(s):  
YanPing Wang ◽  
XiaoHong Sun ◽  
Qi Xue ◽  
Jie Ren ◽  
Fang Dang ◽  
...  

2017 ◽  
Vol 17 (11) ◽  
pp. 3346-3353 ◽  
Author(s):  
Joao Batista Rosolem ◽  
Fabio Renato Bassan ◽  
Daiane Eliene de Freitas ◽  
Felipe Cezar Salgado
Keyword(s):  

2015 ◽  
Author(s):  
F. R. Bassan ◽  
R. S. Penze ◽  
A. A. Leonardi ◽  
J. P. V. Fracarolli ◽  
C. Floridia ◽  
...  

2006 ◽  
Vol 04 (06) ◽  
pp. 1013-1022
Author(s):  
TAILIN LIU ◽  
FENGTONG WEN ◽  
QIAOYAN WEN

Based on the classical binary simplex code [Formula: see text] and any fixed-point-free element f of [Formula: see text], Calderbank et al. constructed a binary quantum error-correcting code [Formula: see text]. They proved that [Formula: see text] has a normal subgroup H, which is a semidirect product group of the centralizer Z(f) of f in GLm(2) with [Formula: see text], and the index [Formula: see text] is the number of elements of Ff = {f, 1 - f, 1/f, 1 - 1/f, 1/(1 - f), f/(1 - f)} that are conjugate to f. In this paper, a theorem to describe the relationship between the quotient group [Formula: see text] and the set Ff is presented, and a way to find the elements of Ff that are conjugate to f is proposed. Then we prove that [Formula: see text] is isomorphic to S3 and H is a semidirect product group of [Formula: see text] with [Formula: see text] in the linear case. Finally, we generalize a result due to Calderbank et al.


Sign in / Sign up

Export Citation Format

Share Document