scholarly journals Construction of Error Control Run Length Limited Codes Exploiting Some Parity Matrix Properties

2015 ◽  
Vol 66 (3) ◽  
pp. 182-184 ◽  
Author(s):  
Katarína Farkašová ◽  
Peter Farkaš ◽  
Martin Rakús ◽  
Eugen Rušický ◽  
Adāo Silva ◽  
...  
Keyword(s):  
Error Control ◽  
Electronic Devices ◽  
Block Code ◽  
Error Control Codes ◽  
New Approach ◽  
Run Length ◽  
Consumer Electronic ◽  
Check Matrix ◽  
Matrix Properties ◽  
New Construction

Abstract Error control codes (ECC) as well as translation codes (TC) are used today in many different systems such as computer storages, communications systems and consumer electronic devices. ECC introduce redundancy into the encoded digital sequence in order to decrease the number of errors at output of its decoder [1]. TC introduce redundancy, in order to translate any digital sequence at the input of TC encoder to such output sequence, which fulfills constrains deduced from practical requirements. It is possible to construct codes, which have both of these properties, so called Transcontrol codes or their subclass error control run length limited (ECRLL) codes. In this manuscript a new approach to construction of EC-RLL codes is presented. The new construction is based on some parity check matrix properties of a linear binary block code from which the new EC-RLL code is obtained.

scholarly journals Construction for obtaining trellis run length limited error control codes from convolutional codes

2017 ◽  
Vol 68 (5) ◽  
pp. 401-404
Author(s):  
Peter Farkaš ◽  
Frank Schindler
Keyword(s):  
Error Control ◽  
Convolutional Codes ◽  
Block Codes ◽  
Parity Check ◽  
Error Control Codes ◽  
Run Length ◽  
Linear Block Codes ◽  
Low Density Parity Check ◽  
New Construction ◽  
The One

Abstract Recently a new construction of run length limited block error control codes based on control matrices of linear block codes was proposed. In this paper a similar construction for obtaining trellis run length limited error control codes from convolutional codes is described. The main advantage of it, beyond its simplicity is that it does not require any additional redundancy except the one which is already contained in the original convolutional error control code. One example is presented how to get such a code from a convolutional low density parity check code.

scholarly journals Run length limited error control codes construction based on one control matrix property

2017 ◽  
Vol 68 (4) ◽  
pp. 322-324
Author(s):  
Peter Farkaš ◽  
Frank Schindler
Keyword(s):  
Error Control ◽  
Specific Property ◽  
Block Codes ◽  
Low Density ◽  
Parity Check ◽  
Simple Method ◽  
Error Control Codes ◽  
Run Length ◽  
Low Density Parity Check ◽  
Matrix Property

AbstractIn this manuscript a simple method is presented for constructing run length limited error control codes from linear binary block codes. The run length limited properties are obtained via addition of a carefully chosen fixed binary vector - a modifier to all codewords without introducing any additional redundancy. Modifier selection is based on a specific property, which can be found in some of the linear binary block codes control matrices. Similar known methods are based on properties of generator matrices. However some codes are specified via control matrices, for example low density parity check codes. The method proposed in this letter could be applied to some of them directly. This is illustrated in this manuscript using example in which a run length limited low density parity check code is obtained from Gallager code.

scholarly journals On run-length limited error control codes constructed from binary product codes

2018 ◽  
Vol 69 (3) ◽  
pp. 245-249
Author(s):  
Peter Farkaš ◽  
Tomáš Janvars ◽  
Katarína Farkašová ◽  
Eugen Ružický
Keyword(s):  
Error Control ◽  
Error Control Codes ◽  
Run Length ◽  
One Dimensional ◽  
Product Codes ◽  
Binary Component ◽  
Control Code ◽  
Error Control Code ◽  
The One

Abstract In this paper it is presented that run-length limited error control codes could be constructed from any two or more- dimensional binary product codes as long as at least one of the one-dimensional binary component codes is or can be converted to a run-length limited error control code. The advantages of this construction are as follows: It does not require any additional redundancy except that which is already contained in the original error control code and that the encoding and decoding procedure used for the underlying error control code do not to be changed

Randomized generation of error control codes with automata and transducers

2018 ◽  
Vol 52 (2-3-4) ◽  
pp. 169-184
Author(s):  
Stavros Konstantinidis ◽  
Nelma Moreira ◽  
Rogério Reis
Keyword(s):  
Error Control ◽  
Randomized Algorithm ◽  
Block Code ◽  
Model Error ◽  
High Likelihood ◽  
Error Control Codes ◽  
Synchronization Errors ◽  
Rational Combination ◽  
Error Detecting ◽  
Positive Integers

We introduce the concept of an -maximal error-detecting block code, for some parameter in (0,1), in order to formalize the situation where a block code is close to maximal with respect to being error-detecting. Our motivation for this is that it is computationally hard to decide whether an error-detecting block code is maximal. We present an output-polynomial time randomized algorithm that takes as input two positive integers N, ℓ and a specification of the errors permitted in some application, and generates an error-detecting, or error-correcting, block code of length ℓ that is 99%-maximal, or contains N words with a high likelihood. We model error specifications as (nondeterministic) transducers, which allow one to represent any rational combination of substitution and synchronization errors. We also present some elements of our implementation of various error-detecting properties and their associated methods. Then, we show several tests of the implemented randomized algorithm on various error specifications. A methodological contribution is the presentation of how various desirable error combinations can be expressed formally and processed algorithmically.

scholarly journals BIM for Existing Construction: A Different Logic Scheme and an Alternative Semantic to Enhance the Interoperabilty

2021 ◽  
Vol 11 (4) ◽  
pp. 1855
Author(s):  
Franco Guzzetti ◽  
Karen Lara Ngozi Anyabolu ◽  
Francesca Biolo ◽  
Lara D’Ambrosio
Keyword(s):  
Project Management ◽  
Building Information Modeling ◽  
Information Modeling ◽  
Historical Buildings ◽  
Architectural Heritage ◽  
New Approach ◽  
Building Information ◽  
Heritage Building ◽  
New Construction

In the construction field, the Building Information Modeling (BIM) methodology is becoming increasingly predominant and the standardization of its use is now an essential operation. This method has become widespread in recent years, thanks to the advantages provided in the framework of project management and interoperability. Hoping for its complete dissemination, it is unthinkable to use it only for new construction interventions. Many are experiencing what happens with the so-called Heritage Building Information Modeling (HBIM); that is, how BIM interfaces with Architectural Heritage or simply with historical buildings. This article aims to deal with the principles and working methodologies behind BIM/HBIM and modeling. The aim is to outline the themes on which to base a new approach to the instrument. In this way, it can be adapted to the needs and characteristics of each type of building. Going into the detail of standards, the text also contains a first study regarding the classification of moldable elements. This proposal is based on current regulations and it can provide flexible, expandable, and unambiguous language. Therefore, the content of the article focuses on a revision of the thinking underlying the process, also providing a more practical track on communication and interoperability.

Sign in / Sign up

Export Citation Format

Share Document