Computing an Invariant of a Linear Code

Author(s):  
Mijail Borges-Quintana ◽  
Miguel Ángel Borges-Trenard ◽  
Edgar Martínez-Moro ◽  
Gustavo Torres-Guerrero
Keyword(s):  
2006 ◽  
Vol 418 (2-3) ◽  
pp. 591-594 ◽  
Author(s):  
Yaokun Wu

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].


2002 ◽  
Vol 1 (1) ◽  
pp. 35
Author(s):  
S. GURITMAN

<p>An [n,k, dh-code is a ternary linear code with length n, dimension k and minimum distance d. We prove that codes with parameters [110,6, 72h, [109,6,71h, [237,6,157b, [69,7,43h, and [120,9,75h do not exist.</p>


2002 ◽  
Vol 14 (77) ◽  
pp. 127-137 ◽  
Author(s):  
Ehud Banin ◽  
Yael Neuberger ◽  
Yaniv Altshuler ◽  
Asaf Halevi ◽  
Ori Inbar ◽  
...  

2016 ◽  
Vol 25 (6) ◽  
pp. 991-998
Author(s):  
Chunming Tang ◽  
Yuenai Chen ◽  
Xuhong Gao

2019 ◽  
Vol 2019 ◽  
pp. 1-11
Author(s):  
Hojoong Park ◽  
Yongjin Yeom ◽  
Ju-Sung Kang

We propose a new lightweight BCH code corrector of the random number generator such that the bitwise dependence of the output value is controllable. The proposed corrector is applicable to a lightweight environment and the degree of dependence among the output bits of the corrector is adjustable depending on the bias of the input bits. Hitherto, most correctors using a linear code are studied on the direction of reducing the bias among the output bits, where the biased input bits are independent. On the other hand, the output bits of a linear code corrector are inherently not independent even though the input bits are independent. However, there are no results dealing with the independence of the output bits. The well-known von Neumann corrector has an inefficient compression rate and the length of output bits is nondeterministic. Since the heavy cryptographic algorithms are used in the NIST’s conditioning component to reduce the bias of input bits, it is not appropriate in a lightweight environment. Thus we have concentrated on the linear code corrector and obtained the lightweight BCH code corrector with measurable dependence among the output bits as well as the bias. Moreover, we provide some simulations to examine our results.


Sign in / Sign up

Export Citation Format

Share Document