A New Powerful Scheme Based on Self Invertible Stabilizer Multiplier Permutation to Find the Minimum Distance for large BCH Codes
Issam Abderrahman Joundan,
Said Nouh,
Abdelwahed Namir
Issue:
Volume 1, Issue 2, June 2018
Pages:
39-43
Received:
7 January 2018
Accepted:
17 January 2018
Published:
21 February 2018
Abstract: In this paper, we present the powerful scheme ZSISMP (Zimmermann Self Invertible Stabilizer Multiplier Permutation) to attack the hardness of the minimum distance search problem of BCH codes. This scheme consists in evaluating the minimum distance of the reduced dimension sub code fixed by a Self Invertible Stabilizer Multiplier Permutation by Zimmermann algorithm. The proposed scheme ZSISMP is validated on all BCH codes of known minimum distance. A comparison with several known powerful techniques proves its efficiency in giving more accurate results in short time. The use of this efficient local search had yield to determine the error correcting capability of many BCH codes of length 1023 and 4095.
Abstract: In this paper, we present the powerful scheme ZSISMP (Zimmermann Self Invertible Stabilizer Multiplier Permutation) to attack the hardness of the minimum distance search problem of BCH codes. This scheme consists in evaluating the minimum distance of the reduced dimension sub code fixed by a Self Invertible Stabilizer Multiplier Permutation by Zimm...
Show More
The Examination of Shall Be Impossible Situations for Verification During Execution
Issue:
Volume 1, Issue 2, June 2018
Pages:
44-54
Received:
18 February 2018
Accepted:
5 March 2018
Published:
23 March 2018
Abstract: Runtime verification is looking for violations of the properties of the system functioning. Finding and describing the system properties that indicate behavioural disorders is a complex and labour-intensive process that needs to be automated. This article describes how system properties can be determined automatically during the correct functioning. Inspection of the combinations of fulfilled properties makes it possible to detect more system problems. Three methods of handling property combinations are offered. The methods are based on the examination of the input sequences and output results. In order to increase the volume of the properties of the system under consideration, only the possible pairs of properties are analysed. Pairs are formed from the output properties, as well as from the input conditions and output properties, and the maximum possible number of property pairs is evaluated. The available property pairs are captured during the operation. Impossible combinations of properties that never occur during the execution highlight situations that are not possible during proper functioning. Capture of impossible property pairs during verification indicates system problems. During the experiment, five types of disorders and three detection methods were considered. Experimental results show that there is no single best method for detecting disorders. Therefore, it is appropriate at the same time to use several methods to detect disorders. The experiment shows how much of the disorders can detect the proposed approach.
Abstract: Runtime verification is looking for violations of the properties of the system functioning. Finding and describing the system properties that indicate behavioural disorders is a complex and labour-intensive process that needs to be automated. This article describes how system properties can be determined automatically during the correct functioning...
Show More
