Research of Two-Modulus Weighted Codes with Summation Involving Arbitrary Partitions of Several Data Symbols-Reference-Cited by-同舟云学术

Research of Two-Modulus Weighted Codes with Summation Involving Arbitrary Partitions of Several Data Symbols

Published:2023-12-11 Issue:4 Volume:9 Page:377-389
ISSN:2412-9186
Container-title:Transport automation research
language:en
Short-container-title:

Author:

Efanov Dmitriy¹²³⁴,Timoshenkov Maksim⁵,Sivachenko Leonid⁶,Leskovec Igor'⁶

Affiliation:

1. Peter the Great Saint Petersburg Polytechnic University

2. Russian University of Transport (MIIT)

3. «Scientific Research and Design Institute «Transport and Construction Safety» LLC

4. Tashkent State Transport University

5. Peter the Great Saint Petersburg Polytechnic University, Higher School of Transport, Mechanical Engineering, Material and Transport Institute

6. Belarusian-Russian University

Abstract

A method has been proposed for constructing two-modulus sum codes that are suitable for solving the synthesis problems of self-checking digital computing devices and systems, as well as the technical means of their diagnostics. In the process of constructing a code, a set of data symbols is divided into two subsets, forming separate vectors for which the total weight is calculated according to a predetermined modulus. Beforehand, in each of the selected vectors, one of the data symbols is weighted with a coefficient from a natural series. Codes obtained with different values of weight coefficients and modulus for determining the total weight form a separate family of uniform binary codes with a fixed number of check symbols. The article provides an example of constructing a sum codes in the ring of residues modulus M = 4. Using this modulus enables the construction of a two-modulus code with k = 4 check symbols for any value of the m number of data symbols. As the value of m increases, the relationship between the number of data symbols and check symbols will change significantly, and the resulting code will have low redundancy. This is important when using the considered class of codes in the construction of digital devices. Previously unknown properties of the discussed class of sum codes have been identified, and taking these into account is beneficial when addressing problems related to the synthesis and technical diagnostics of digital devices.

Publisher

Petersburg State Transport University

Subject

General Medicine

Reference36 articles.

1. Lala P. K. Self-Checking and Fault-Tolerant Digital Design / P. K. Lala. — San Francisco: Morgan Kaufmann Publishers, 2001. — 216 p., Lala P. K. Self-Checking and Fault-Tolerant Digital Design / P. K. Lala. — San Francisco: Morgan Kaufmann Publishers, 2001. — 216 p.

2. Berger J. M. A Note on Error Detection Codes for Asymmetric Channels / J. M. Berger // Information and Control. — 1961. — Vol. 4. — Iss. 1. — Pp. 68–73. — DOI: 10.1016/S0019-9958(61)80037-5., Berger J. M. A Note on Error Detection Codes for Asymmetric Channels / J. M. Berger // Information and Control. — 1961. — Vol. 4. — Iss. 1. — Pp. 68–73. — DOI: 10.1016/S0019-9958(61)80037-5.

3. Ryan W. E. Channel Codes: Classical and Modern / W. E. Ryan, S. Lin. — Cambridge University Press, 2009, 708 р., Ryan W. E. Channel Codes: Classical and Modern / W. E. Ryan, S. Lin. — Cambridge University Press, 2009, 708 r.

4. Fujiwara E. Code Design for Dependable Systems: Theory and Practical Applications / E. Fujiwara // John Wiley & Sons. — 2006. — 720 p., Fujiwara E. Code Design for Dependable Systems: Theory and Practical Applications / E. Fujiwara // John Wiley & Sons. — 2006. — 720 p.

5. Berger J. M. A Note on Burst Detection Sum Codes / J. M. Berger // Information and Control. — 1961. — Vol. 4. — Iss. 2-3. — Pp. 297–299. — DOI: 10.1016/S0019-9958(61)80024-7., Berger J. M. A Note on Burst Detection Sum Codes / J. M. Berger // Information and Control. — 1961. — Vol. 4. — Iss. 2-3. — Pp. 297–299. — DOI: 10.1016/S0019-9958(61)80024-7.