Search

Incorporating information security and error correction in network coding, which has various applications in communication theory, for example, secret key sharing through a network, is of special interest and has been widely studied. To make a more intensive analysis of secure error-correcting network codes, we investigate how to secure k source symbols transmission in a multicast network against an adversary that can obtain k1 source symbols as side information, eavesdrop µ channels and contaminate d channels. We introduce relative network generalised Hamming weight (RNGHW) with network error correction (NEC), or briefly NEC-RNGHW, to measure the equivocation to the adversary. Network generalised singleton bound on NEC-RNGHW is obtained and code constructions achieving the bound are provided. By these constructions, the maximum rate of a secure linear multicast is n - 2d - &#µ; - k1, where n is the minimum value of the maxflows from a source node to sink nodes. We also characterise the equivocation by the relative profiles of a linear code and a subcode, and tighten the singleton bound on equivocation by the generalised Griesmer bound on relative profiles. [ABSTRACT FROM AUTHOR]

Generalized balanced tournament packings (GBTPs) extend the concept of generalized balanced tournament designs introduced by Lamken and Vanstone (1989). In this paper, we establish the connection between GBTPs and a class of codes called equitable symbol weight codes (ESWCs). The latter were recently demonstrated to optimize the performance against narrowband noise in a general coded modulation scheme for power line communications. By constructing classes of GBTPs, we establish infinite families of optimal ESWCs with code lengths greater than alphabet size and whose narrowband noise error-correcting capability to code length ratios do not diminish to zero as the length grows. [ABSTRACT FROM AUTHOR]

. The study reported in this paper investigated the repair distribution, the error correction rates and the repair successfulness in the speech of L2 learners, with the goal to find out more information on the monitoring skills and repair behaviour. The research also included a detailed subcategory analysis within syntactic, lexical and morphological categories which have not been investigated so far. The lowest correction rates were observed in the case of morphological subcategories, showing that the speakers' attention was not oriented towards grammatical accuracy. The findings of this study may find practical application in foreign language teaching, suggesting possible reviews of formal teaching methods, aiming at more efficient linking of grammatical development to the ability to communicate. [ABSTRACT FROM AUTHOR]

In many applications, an incoming value is compared against one or more values stored in registers. To avoid data corruption, the registers are in some cases protected with a single error correction (SEC) code. Therefore, in a traditional implementation, SEC decoding would be done before the comparison. However, previous works have shown that it may be more efficient to compare the SEC encoded values directly using a distance one comparison. This distance one comparison prevents single bit errors from affecting the result of the comparison and is in many cases simpler than an SEC decoding plus a traditional comparison. It is shown that the use of single-error correction double error detection (SEC-DED) encoded registers enables a simplified distance one comparison that can further reduce the cost of implementing error protection for register comparison. [ABSTRACT FROM AUTHOR]

Static random-access memory (SRAM) based memories are widely used in electronic systems and if their contents change due to external reasons, the electronic system can functionally fail. One of the external reasons is the radiation induced soft errors as the SRAM memories are susceptible to radiation effects. Majority of the recently proposed methods use error correction codes (ECC) to mitigate soft errors. Error correction/detection capabilities of such methods are at most 3 bits in a codeword which will be insufficient while number of memory bits affected by a radiation particle is increased, as CMOS process technology shrinks towards around 5 nm. Since memory bits affected by a radiation particle are physically close, adjacent error detection/ correction becomes a hot research topic. In this Letter, Euclidean geometry-low density parity check code, more capable ECC than Hamming code used in recent works, is explored in context of adjacent error detection performance. The results show that proposed method successfully detects up to 14-bit adjacent errors in a 15-bit codeword. As such, this method is suitable where high detection performance is needed. The proposed method is also simplified for efficient hardware implementation while detection performance is not sacrificed. Both methods are compared in terms of resource usage. [ABSTRACT FROM AUTHOR]

Summary: Cloud storage is gaining popularity as it relieves the data owners from the burden of data storage and maintenance cost. However, outsourcing data to third‐party cloud servers raise several concerns such as data availability, confidentiality, and integrity. Recently, regenerating codes have gained popularity because of their low repair bandwidth while ensuring data availability. In this paper, we propose a secure regenerating code‐based cloud storage (SRCCS) scheme, which utilizes the verifiable computation property of homomorphic encryption scheme to check the integrity of outsourced data. In this work, an error‐correcting code (ECC)–based homomorphic encryption scheme (HES) is employed to simultaneously provide data privacy as well as error correction while supporting efficient integrity verification. In SRCCS, server regeneration process is initiated on detection of data corruption events in order to ensure data availability. The ECC‐based HES significantly reduces the probability of server regeneration and minimizes the repair cost. Extensive theoretical analysis and simulation results validate the security, efficiency, and practicability of the proposed scheme. [ABSTRACT FROM AUTHOR]

An error-correcting code (ECC) immune to bit errors can make memory performance severely degraded since incomplete-word ECC write requests lead to inefficient operations on a dual in-line memory module (DIMM). A DIMM controller efficient for such ECC operations is proposed. The key idea is that read-to-write and write-toread operations caused by incomplete-word ECC write requests are split into independent read and write operations, and then the read and write operations are individually scheduled under data coherence constraints. Experimental results show that the proposed DIMM controller achieves 11% shorter memory latency, and 9.3% higher memory utilisation, on average, than the latest conventional DIMM controller in industrial multimedia applications. Moreover, it achieves up to 2.1 times higher memory performance on synthetic benchmarks. [ABSTRACT FROM AUTHOR]

An improved error code correction algorithm for phase-shifted optical quantisation is presented and experimentally demonstrated. The error probabilities for each valid code are calculated and the invalid codes are corrected by using the maximum likelihood estimation algorithm. The experimental result shows that the spur-free dynamic range of the system has an improvement of 2.28 dB compared to the Hamming algorithm in a 10-GSamples/s, 4-bit resolution all-optical analogue-to-digital converter. [ABSTRACT FROM AUTHOR]