Results 81 to 90 of about 20,665,160 (118)

A Method of Extended Finite State Machines Construction from HDL Descriptions Based on Static Analysis of Source Code

open access: yesSt. Petersburg State Polytechnical University Journal. Computer Science. Telecommunications and Control Systems., 2015
S.A. Smolov, A.S. Kamkin
openaire   +1 more source

and P.Charpin, The automorphism groups of BCH codes and of some affine-invariant codes over extension fields, Design, Codes and Cryptography

open access: yes, 1999
. Affine-invariant codes are extended cyclic codes of length p m invariant under the affine-group acting on F p m . This class of codes includes codes of great interest such as extended narrow-sense BCH codes.
Thierry P Berger
core  

On Extended Codes of Linear Codes over Finite Fields

open access: yes
The construction of linear codes over finite fields with good parameters is one of the most interesting and fundamental topics in coding theory. This problem is of particular interest especially if the parameters of the code are “optimal” in a well-known
Chen, Tingfang
core  

Constructing CSS-T Codes from Extended Quasi-Cyclic Codes [PDF]

open access: yes
We analyze a construction of quasi-cyclic codes in an extension field based on the polynomials which generate the corresponding codes in the base fields.
George, Ross Patrick
core  

On extended perfect codes

open access: yes
We consider extended $1$-perfect codes in Hamming graphs $H(n,q)$. Such nontrivial codes are known only when $n=2^k$, $k\geq 1$, $q=2$, or $n=q+2$, $q=2^m$, $m\geq 1$.
Vorob'ev, Konstantin
core  

Iterative Construction of Reversible Variable-Length Codes and Variable-Length Error-Correcting Codes

open access: yes, 2004
We propose a generic algorithm for the construction of efficient reversible variable-length codes (RVLCs) and variable-length error-correcting (VLEC) codes, which optimizes the codeword length distribution.
Wang, J., Yang, L-L., Hanzo, L.
core  

Spatially-Coupled Codes With Extended Hamming Constituents

open access: yes
In designing error-correcting codes for high-throughput fibre-optic applications, extended Hamming constituent codes have been largely overlooked in favour of more powerful (but more complex) double- and triple-error-correcting Bose-Ray-Chaudhuri ...
Zhu, James
core  

An algorithm for BCH codes extended with finite state automata

open access: yesFundam. Informaticae, 2008
Summary: This article develops a combinatorial algorithm for a class of codes extending BCH codes and constructed with finite state automata. Our algorithm computes the largest number of errors that the extended codes can correct, and finds a generator for each optimal code in this class of extensions.
Kelarev, Andrei
openaire   +3 more sources
Some of the next articles are maybe not open access.

Related searches:

Assessing test suites of extended finite state machines against model‐ and code‐based faults

Software Testing, Verification and Reliability, 2021
SummaryTests can be derived from extended finite state machine (EFSM) specifications considering the coverage of single‐transfer faults, all transitions using a transition tour, all‐uses, edge‐pair, and prime path with side trip. We provide novel empirical assessments of the effectiveness of these test suites.
Khaled El-Fakih   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy