A linear code-preserving signature analyzer COPMISR

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

Download Full-text

Computing an Invariant of a Linear Code

Mathematical Aspects of Computer and Information Sciences - Lecture Notes in Computer Science ◽

10.1007/978-3-030-43120-4_17 ◽

2020 ◽

pp. 218-233

Author(s):

Mijail Borges-Quintana ◽

Miguel Ángel Borges-Trenard ◽

Edgar Martínez-Moro ◽

Gustavo Torres-Guerrero

Keyword(s):

Linear Code

Download Full-text

Mixed signal testing system technique with algebraic signature analyzer without carry propagation

10.32920/ryerson.14654679.v1 ◽

2021 ◽

Author(s):

Mohammed Faruque Ahmed

Keyword(s):

Testing System ◽

Signal System ◽

High Complexity ◽

Hardware Complexity ◽

Mixed Signal ◽

Algebraic Signature ◽

Signature Analyzer ◽

System Technique ◽

Algebraic Cryptography ◽

Mixed Signal Testing

Signature Analyzer is an analyzer which is widely used for mixed-signal system testing. But its hardware has high complexity in implementation as the application technique is a system with rules of an arithmetic finite field with arbitrary radix. It’s a challenging task. To avoid this complexity here the project is made based on Algebraic Signature Analyzer that can be used for mixed signal testing and the analyzer doesn’t contain carry propagation circuitry. It improves performance and fault tolerance. This technique is simple and applicable to systems of any size or radix. The hardware complexity is very low compared to the conventional one and can be used in arithmetic/ algebraic cryptography as well as coding

Download Full-text

What Causes to Tune a Condition of Exactly Identical Fault-Masks Behaviors in an LFSR based BIST Methodology

Oriental journal of computer science and technology ◽

10.13005/ojcst/10.04.02 ◽

2017 ◽

Vol 10 (04) ◽

pp. 710-717

Author(s):

A. Ahmad ◽

D. Al Abri ◽

S. S. Al Busaidi ◽

M. M. Bait-Suwailam

Keyword(s):

Linear Feedback ◽

Test Sequence ◽

Linear Feedback Shift Registers ◽

Random Test ◽

Signature Analyzer ◽

Simulation Results ◽

Feedback Shift Registers ◽

Self Test ◽

Sequence Generator ◽

Feedback Connections

The authors show that in a Built-In Self-Test (BIST) technique, based on linear-feedback shift registers, when the feedback connections in pseudo-random test-sequence generator and signature analyzer are images of each other and corresponds to primitive characteristic polynomial then behaviors of faults masking remains identical. The simulation results of single stuck-at faults show how the use of such feedback connections in pseudo-random test-sequence generator and signature analyzer yields to mask the same faults.

Download Full-text

Nonexistence Proofs for Five Ternary Linear Codes

Journal of Mathematics and Its Applications ◽

10.29244/jmap.1.1.35-40 ◽

2002 ◽

Vol 1 (1) ◽

pp. 35

Author(s):

S. GURITMAN

Keyword(s):

Linear Code ◽

Minimum Distance ◽

Linear Codes ◽

Ternary Linear Codes

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

Download Full-text