Error control and Coding theory Research Papers (original) (raw)

This paper considers the implementation of cyclic codes encoder and decoder for multimedia content in the form of sound data using National Instruments LabView software. Cyclic codes can be defined by two parameters, which are code size n and information bit size k. LabView is an easy to use, multipurpose software which has many features for designing and prototyping. This research is a preliminary research on channel coding implementation on LabView. In this research, cyclic codes are used to implement the design. 16-bit sound data are used as test subjects for cyclic code encoding, decoding, and error correction. The result shows that the design works well. The design can correct short two-bit error in last n-k position of the codeword. Authors’ next project is to implement more advanced code for error correcting implementation in LabView.

International Journal on Information Theory (IJIT) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Information Theory. Authors are solicited to contribute to the journals by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the areas of Information Theory and applications.

This paper considers the prototyping of linear block codes encoder and decoder for sound data using National Instruments LabView software. Linear block codes can be defined by two parameters, which are code size n and information bit size k. LabView is an easy to use, multipurpose software which has many features for designing and prototyping. This research is a preliminary research on channel coding implementation on LabView. In this research, Reed-Muller codes are used to implement the design. 16-bit sound data are used as test subjects for block code encoding, decoding, and error correction. The result shows that the design works well. The design can correct single bit error in any positions. Authors’ next project is to implement cyclic and more advanced code for error correcting implementation in LabView.

Scope 8 th International Conference on Control, Modeling and Computing (CMC 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Control Engineering, Modeling, Computing and Applications. The goal of this Conference is to bring together researchers and practitioners from academia and industry to focus on understanding modern Control Engineering, Modeling and Computing concepts and establishing new collaborations in these areas.

11th International Conference on Control, Modelling, Computing and Applications (CMCA 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Control Engineering, Modelling, Computing and Applications. The goal of this Conference is to bring together researchers and practitioners from academia and industry to focus on understanding Modern Control Engineering, Modelling and Computing concepts and establishing new collaborations in these areas. Authors are solicited to contribute to the conference by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the following areas, but are not limited to. Topics of interest include, but are not limited to, the following  Adaptive Control  Applications of Modelling in Science and Engineering

Progress in image sensors and computation power has fueled studies to improve acquisition, processing, and analysis of 3D streams along with 3D scenes/objects reconstruction. The role of motion compensation/ motion estimation (MCME) in 3D TV from end-to-end user is investigated in this chapter. Motion vectors (MVs) are closely related to the concept of disparities, and they can help improving dynamic scene acquisition, content creation, 2D to 3D conversion, compression coding, decompression/decoding, scene rendering, error concealment, virtual/augmented reality handling, intelligent content retrieval, and displaying. Although there are different 3D shape extraction methods, this chapter focuses mostly on shape-from-motion (SfM) techniques due to their relevance to 3D TV. SfM extraction can restore 3D shape information from a single camera data.

- by Vania V Estrela
- •
- Computer Science, Computer Graphics, Human Computer Interaction, Computer Vision
- by Omar Al-Askary
- •
- Coding Theory, Error control and Coding theory

The idea of neutrosophic code came into our mind at that time when we were reading the literature about linear codes and we saw that, if there is data transfremation between a sender and a reciever. They want to send 11and 00 as codewords. They suppose 11 for true and 00 for false. When the sender sends these two codewords and the error occures. As a result the reciever recieved 01 or 10 instead of 11 and 00. This story give a way to the neutrosophic codes and thus we introduced neutrosophic codes over finite field in this paper.

- by Mumtaz Ali and +2
- •
- Coding Theory, Coding theory applied to Genetic Networks, Error control and Coding theory, Error Control Coding

One of the key technologies for future IoT/M2M systems are low power wide area networks, which are designed to support a massive number of low-end devices often in the unlicensed shared spectrum using random access protocols. However these usually operate without centralised control and since Automatic Repeat request and acknowledgement mechanisms are not very effective due to the strict duty cycles limits and high interference in the shared bands, many packets are lost from collisions. In this paper we analyse a recently proposed application layer coding scheme, which aims to recover lost packets by introducing redundancy in the form of a fountain code. We show how latency and decoding complexity is affected by the packet loss rate but also prove that there is a limit to what can be achieved by introducing more redundancy. The analysis is backed up by simulation results

Barnes and Sheppard (2009) assume that an anti-monist and anti-reductionist economic geography is desirable and that this desirability is so obvious that no argument needs to be advanced in its support. This commentary challenges this assumption and suggests that a monist and reductionist economic geography organized around the idea of truth-seeking is neither unthinkable nor unpalatable. In order to flesh out this idea, the commentary builds on recent work in the philosophy of scientific induction to show why one of its less publicized advances – error statistical theory – holds far more promise for the future development of economic geography than Barnes and Sheppard's vague and nebulous 'engaged pluralism'.

- by Dragos Simandan
- •
- Critical Theory, Intellectual History, Economic History, Sociology

Polygon approximation plays a vital role in abquitious applications like multimedia, geographic and object recognition. An extensive number of polygonal approximation techniques for digital planar curves have been proposed over the last decade, but there are no survey papers on recently proposed techniques. Polygon is a collection of edges and vertices. Objects are represented using edges and vertices or contour points (ie. polygon). Polygonal approximation is representing the object with less number of dominant points (less number of edges and vertices). Polygon approximation results in less computational speed and memory usage. This paper deals with comparative study on polygonal approximation techniques for digital planar curves with respect to their computation and efficiency.

A new efficient modified back propagation algorithm with adaptive learning rate is proposed to increase the convergence speed and to minimize the error. The method eliminates initial fixing of learning rate through trial and error and replaces by adaptive learning rate. In each iteration, adaptive learning rate for output and hidden layer are determined by calculating differential linear and nonlinear errors of output layer and hidden layer separately. In this method, each layer has different learning rate in each iteration. The performance of the proposed algorithm is verified by the simulation results.

- by Herbert Palines
- •
- Error control and Coding theory, Hyperbolic Geometry
- by Omar Al-Askary and +1
- •
- Coding Theory, Wireless Communications, Error control and Coding theory, Ofdm Systems
- by sophan nawawi
- •
- Mobile Robotics, Control Theory, Optimal Control, Fuzzy Logic

New number-theoretic transforms are derived from known linear block codes over finite fields. In particular, two new such transforms are built from perfect codes, namely the Hamming number-theoretic transform and the Golay... more

- by Ricardo Campello
- •
- Mathematics, Number Theory, Computer Science, Error control and Coding theory

New number-theoretic transforms are derived from known linear block codes over finite fields. In particular, two new such transforms are built from perfect codes, namely the \textit {Hamming number-theoretic transform} and the \textit... more

- by Arquimedes Paschoal
- •
- Mathematics, Number Theory, Computer Science, Error control and Coding theory

This paper proposes a correction method, which corrects the actual compressor performance in real operating conditions to the equivalent performance under specified reference condition. The purpose is to make fair comparisons between actual performance against design performance or reference maps under the same operating conditions. Then the abnormal operating conditions or early failure indications can be identified through condition monitoring, which helps to avoid mandatory shutdown and reduces maintenance costs. The corrections are based on an iterative scheme, which simultaneously correct the main performance parameters known as the polytropic head, the gas power, and the polytropic efficiency. The excellent performance of the method is demonstrated by performing the corrections over real industrial measurements.

Additional check bits, which are commonly attached to the message's input data, are normally used to minimize the error during data transmission. The receiver system implements a checking algorithm to determine if an error was occurred in the received data. This algorithm will correct a corrupted bit and recover the original message. An enhanced error detection correction code was presented to better detect and correct the corrupted conveyed bits. It improves the existing limitations of utilizing cyclic redundancy checking (CRC), Hamming code, and other checksum techniques. Also, it reduced the length of the redundancy bits which exists in CRC, the overhead of interspersing of the redundancy bits in a typical Hamming code, and the system resources such as processor time and bandwidth in checksum techniques. This paper was synthesized and simulated using the Xilinx Spartan 6 (XC7Z020-2CLG4841) FPGA. Results show that the resource utilization of the designed memory architecture using EEDC is lower compared to CRC, Hamming, and Checksum algorithms.

The International Journal of Control Theory and Computer Modelling (IJCTCM) is a Quarterly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Control Theory and Computer Modelling. The journal focuses on all technical and practical aspects of Control Theory and Computer Modelling. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced control engineering and modeling concepts and establishing new collaborations in these areas.

- by Mohamad Amir Shamsudin
- •
- Engineering, Computer Science, Mobile Robotics, Control Theory

A construção de novos códigos de bloco lineares pode ser feita a partir de trans- formadas digitais. Aqui, mostramos que novas transformadas digitais podem ser derivadas a partir de códigos corretores de erros. Primeiro, apresentamos a construção de códigos de Pascal, baseados na Transformada Numérica de Pascal (TNP), e então as transformadas de Hamming e Golay baseadas, respectivamente, nos códigos de mesmo nome. Um Algoritmo para a decodificação de códigos de Pascal é apresentado. Uma aplicação das transformadas numéricas de Pascal, Hamming e Golay, como uma ferramenta de pré-processamento para cifragem de imagens, é sugerida.

Unstable wheel inverted pendulum is modelled and controlled deploying Kane's method and optimal partial-state PID control scheme. A correct derivation of nonlinear mathematical model of a wheel inverted pendulum is obtained using a proper definition of the geometric context of active and inertia forces. Then the model is decoupled to two linear subsystems namely balancing and heading subsystems. Afterward partial-state PID controller is proposed and formulated to quadratic optimal regulation tuning method. It enables partial-state PID to be optimally tuned and guarantees a satisfactory level of states error and a realistic utilization of torque energy. Simulation and numerical analyses are carried out to analyse system's stability and to determine the performance of the proposed controller for mobile wheel inverted pendulum application.

This article describes an encoding strategy through repetition codes for error protecting of the WiMedia payload. Such codes have usually their application rather restrained due to their low transmission rates over low error probabilities. A binary symmetric channel (BSC) was used to evaluate the system performance and a number of simulations were done to assess the influence of the parameters of the coded system. The chief idea is to select the maximum acceptable error probability and fade probability followed by the designing of the repetition coding scheme so as to maximize the transmission rate. Simulations results show that this pseudorandom adaptive technique presents better performance at low error probability, besides offering a tradeoff between rate and error probability.

"What are introns for? In spite of the fact that they may protect the integrity of the genes, it is almost consent that they have no obvious error control function. This paper answers, to a certain extent, a number of inquiries about introns. It is enlightened why the difference between eukaryotic and prokaryotic transcription arise. Arguments in opposition to the “introns-early theory” are presented. It is suggested that introns have gradually took place in eukaryotic cells as a (Darwinian) probabilistic mechanism to protect replication. We elucidate the mechanisms involved in the augmenting the reliability of the DNA replication by unveiling a nonconforming way to put redundancy to work. Biological evolutionary codes match Shannon’s paradigm: they are long truly random codes. On the contrary with current ideas about random codes, they have an,uncomplicated decoding algorithm. It is suggested therefore that effort for discovering introns’ functional error-control properties should not be made, nor should code structure be searched behind introns.
"