Interaction faults caused by a flawed external system designed by a third party are a major issue faced by interconnected systems. In this paper, we define a scenario where this type of problem occurs, and describe some fault cases observed in real systems. We also discuss the most important challenges faced in this scenario, focusing on error detection. The problem is divided in several sub-pr...

A fundamental concept in secure communication of data is the ability to detect and correct errors. In this report, we analyse a sophisticated error detection and correction algorithm when the communication medium consists of written messages tied to the legs of carrier pigeons.

To integrate large systems of locally coupled ordinary differential equations (ODEs) with disparate timescales, we present a multirate method with error control that is based on the Cash-Karp Runge-Kutta (RK) formula. The order of multirate methods often depends on interpolating certain solution components with a polynomial of sufficiently high degree. By using cubic interpolants and analyzing ...

Recent advances in technology have produced a requirement for new implementations of good error-correcting codes. Such applications of codes also require efficient encoding and decoding methods. The method of permutation decoding was first developed by Jessie MacWilliams in the early 60’s and can be used when a linear code has a sufficiently large automorphism group to ensure the existence of a...

This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New upper bounds on the maximum-likelihood (ML) decoding error probability are derived. These bounds are applied to various ensembles of turbo-like codes, focusing especially on repeat-accumulate codes and their recent va...

Received: December 9, 2010 Accepted: January 6, 2011 doi:10.5539/jmr.v3n2p126 Abstract Stepwise local error control using local extrapolation in Runge-Kutta methods is well-known. In this paper, we introduce an algorithm, designated RKrvQz, that is capable of controlling local and global errors in a stepwise manner. The algorithm utilizes three Runge-Kutta methods, of orders r, v and z, with r ...

We define analog product codes as a special case of analog parallel concatenated codes. These codes serve as a tool to get some more insight into the convergence of “Turbo” decoding. We prove that the iterative “Turbo”-like decoding of analog product codes indeed is an estimation in the least-squares sense and thus correspond to the optimum maximum-likelihood decoding.

We propose a new variant of the McEliece cryptosystem which ensures that the code used as the public key is not permutationequivalent to the secret code. This allows to increase the security of the public key, and to reconsider possible adoption of classical families of codes, like Reed-Solomon codes. A reduction in the key size or, equivalently, an increased level of security against informati...