DECODING OF STRUCTURALLY AND LOGICAL CODES
The article deals with the description of the main points of the structural and logical coding and the features of SLC codes. There are shown the basic points of the generalized algorithm of decoding SLC, which is based on the method of perfect matrix arrangement (PMA) of the n-dimensional cube vert...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Belarusian National Technical University
2016-07-01
|
| Series: | Системный анализ и прикладная информатика |
| Subjects: | |
| Online Access: | https://sapi.bntu.by/jour/article/view/104 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832557312525467648 |
|---|---|
| author | Yu. D. Ivanov I. N. Nikolov B. V. Lozka |
| author_facet | Yu. D. Ivanov I. N. Nikolov B. V. Lozka |
| author_sort | Yu. D. Ivanov |
| collection | DOAJ |
| description | The article deals with the description of the main points of the structural and logical coding and the features of SLC codes. There are shown the basic points of the generalized algorithm of decoding SLC, which is based on the method of perfect matrix arrangement (PMA) of the n-dimensional cube vertices for adequate representation and transformation of boolean functions, which is based on the method of generating sequences of variables for building the maximum coverage of the cube vertices. The structural and logical codes (SLC) use natural logic redundancy of the infimum disjunctive normal forms (IDNF) of boolean functions, which make the basis for building the SLC codes and correcting the errors, that occur during data transfer in real discrete channels, on the channels with independent errors. The main task is to define the basic relations between the implemented SLC codes of the logical redundancy and boundary values of multiplicity of independent errors which are corrected. The principal difference between the SLC codes and the well-known correcting codes is that the redundancy, that is needed to correct the errors in converting the discrete information, is not introduced into an additional code sequence but is defined in a natural way, during the construction of codewords of SLC. |
| format | Article |
| id | doaj-art-7388cbcd4ccd4e098658824d51739f15 |
| institution | Kabale University |
| issn | 2309-4923 2414-0481 |
| language | English |
| publishDate | 2016-07-01 |
| publisher | Belarusian National Technical University |
| record_format | Article |
| series | Системный анализ и прикладная информатика |
| spelling | doaj-art-7388cbcd4ccd4e098658824d51739f152025-02-03T05:16:56ZengBelarusian National Technical UniversityСистемный анализ и прикладная информатика2309-49232414-04812016-07-010288DECODING OF STRUCTURALLY AND LOGICAL CODESYu. D. Ivanov0I. N. Nikolov1B. V. Lozka2Odessa National Polytechnic UniversityOdessa National Polytechnic UniversityOdessa National Polytechnic UniversityThe article deals with the description of the main points of the structural and logical coding and the features of SLC codes. There are shown the basic points of the generalized algorithm of decoding SLC, which is based on the method of perfect matrix arrangement (PMA) of the n-dimensional cube vertices for adequate representation and transformation of boolean functions, which is based on the method of generating sequences of variables for building the maximum coverage of the cube vertices. The structural and logical codes (SLC) use natural logic redundancy of the infimum disjunctive normal forms (IDNF) of boolean functions, which make the basis for building the SLC codes and correcting the errors, that occur during data transfer in real discrete channels, on the channels with independent errors. The main task is to define the basic relations between the implemented SLC codes of the logical redundancy and boundary values of multiplicity of independent errors which are corrected. The principal difference between the SLC codes and the well-known correcting codes is that the redundancy, that is needed to correct the errors in converting the discrete information, is not introduced into an additional code sequence but is defined in a natural way, during the construction of codewords of SLC.https://sapi.bntu.by/jour/article/view/104structural and logical codesinfimum disjunctive normal formboolean functionsgeneralized method of decodingperfect matrix arrangementa common encoding format |
| spellingShingle | Yu. D. Ivanov I. N. Nikolov B. V. Lozka DECODING OF STRUCTURALLY AND LOGICAL CODES Системный анализ и прикладная информатика structural and logical codes infimum disjunctive normal form boolean functions generalized method of decoding perfect matrix arrangement a common encoding format |
| title | DECODING OF STRUCTURALLY AND LOGICAL CODES |
| title_full | DECODING OF STRUCTURALLY AND LOGICAL CODES |
| title_fullStr | DECODING OF STRUCTURALLY AND LOGICAL CODES |
| title_full_unstemmed | DECODING OF STRUCTURALLY AND LOGICAL CODES |
| title_short | DECODING OF STRUCTURALLY AND LOGICAL CODES |
| title_sort | decoding of structurally and logical codes |
| topic | structural and logical codes infimum disjunctive normal form boolean functions generalized method of decoding perfect matrix arrangement a common encoding format |
| url | https://sapi.bntu.by/jour/article/view/104 |
| work_keys_str_mv | AT yudivanov decodingofstructurallyandlogicalcodes AT innikolov decodingofstructurallyandlogicalcodes AT bvlozka decodingofstructurallyandlogicalcodes |