Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 5,100 papers for “Redundant code”

Multilevel Balanced Code with Redundant Digits

T. Asabe · IEEE Transactions on Communications · 1974

In this concise paper, several coding schemes are proposed for transmitting digital information over a cable with dc cutoff. The codes are composed of information digits and balance digits determined by the weight of the former. It is shown that the encoding and decoding circuits are quite simple, and that the dc component of the codes is negligibly small. Furthermore, the lowfrequency components of the spectrum can be made much smaller by changing the balance digit positions. Exploiting the fact that the weight of almost all codes is zero, and using the coding rule presented, block synchronization can be easily obtained and most transmission errors can be detected.

Cited by 1

A Redundant Cortical Code for Speech Envelope

Kristina B. Penikis, Dan H. Sanes · Journal of Neuroscience · 2022

Animal communication sounds exhibit complex temporal structure because of the amplitude fluctuations that comprise the sound envelope. In human speech, envelope modulations drive synchronized activity in auditory cortex (AC), which correlates strongly with comprehension (Giraud and Poeppel, 2012; Peelle and Davis, 2012; Haegens and Zion Golumbic, 2018). Studies of envelope coding in single neurons, performed in nonhuman animals, have focused on periodic amplitude modulation (AM) stimuli and use response metrics that are not easy to juxtapose with data from humans. In this study, we sought to bridge these fields. Specifically, we looked directly at the temporal relationship between stimulus envelope and spiking, and we assessed whether the apparent diversity across neurons' AM responses contributes to the population representation of speech-like sound envelopes. We gathered responses from single neurons to vocoded speech stimuli and compared them to sinusoidal AM responses in auditory cortex (AC) of alert, freely moving Mongolian gerbils of both sexes. While AC neurons displayed heterogeneous tuning to AM rate, their temporal dynamics were stereotyped. Preferred response phases accumulated near the onsets of sinusoidal AM periods for slower rates (<8 Hz), and an over-representation of amplitude edges was apparent in population responses to both sinusoidal AM and vocoded speech envelopes. Crucially, this encoding bias imparted a decoding benefit: a classifier could discriminate vocoded speech stimuli using summed population activity, while higher frequency modulations required a more sophisticated decoder that tracked spiking responses from individual cells. Together, our results imply that the envelope structure relevant to parsing an acoustic stream could be read-out from a distributed, redundant population code.<b>SIGNIFICANCE STATEMENT</b> Animal communication sounds have rich temporal structure and are often produced in extended sequences, including the syllabic structure of human speech. Although the auditory cortex (AC) is known to play a crucial role in representing speech syllables, the contribution of individual neurons remains uncertain. Here, we characterized the representations of both simple, amplitude-modulated sounds and complex, speech-like stimuli within a broad population of cortical neurons, and we found an overrepresentation of amplitude edges. Thus, a phasic, redundant code in auditory cortex can provide a mechanistic explanation for segmenting acoustic streams like human speech.

Cited by 18Open access

Decoding Reed–Muller Codes Using Redundant Code Constraints

Mengke Lian, Christian Häger, Henry D. Pfister · Chalmers Research (Chalmers University of Technology) · 2020

The recursive projection-aggregation (RPA) decoding algorithm for Reed-Muller (RM) codes was recently introduced by Ye and Abbe. We show that the RPA algorithm is closely related to (weighted) belief-propagation (BP) decoding by interpreting it as a message-passing algorithm on a factor graph with redundant code constraints. We use this observation to introduce a novel decoder tailored to high-rate RM codes. The new algorithm relies on puncturing rather than projections and is called recursive puncturing-aggregation (RXA). We also investigate collapsed (i.e., non-recursive) versions of RPA and RXA and show some examples where they achieve similar performance with lower decoding complexity.

Cited by 39Open access

Efficient code excited linear predictor using redundant vector quantiser representations

Journal of International Crisis and Risk Communication Research · 2001

A novel linear prediction (LP) model-bused coding technique is presented. where the advantages of multiple non-orthogonal domain representations of LP coefficients and the residuals are exploited in conjunction with vector quantisation. The proposed technique is applied to speech signals and the resulting performance improvement is clearly demonstrated in terms of the reconstruction quality.

Cited by 0Open access

A fast Reed-Solomon Product-Code decoder without redundant computations

Hyun-Yong Lee, In‐Cheol Park · 2004

This paper presents a fast and low-power decoding scheme for Reed-Solomon Product-Code (RS-PC). To increase error correction capability of RS-PC, we need to repeat Reed-Solomon (RS) decoding several times for rows and columns. As the number of RS decodings increases, the execution time and the energy consumption also increase as well. In order to reduce unnecessary operations and memory accesses, we added two small memories to store data on whether the row or column is updated or not. In the next iteration, only the updated rows and columns are recalculated instead of the whole rows and columns. Based on the proposed scheme, we implemented a RS-PC decoder using UMC 0.25 /spl mu/m standard and memory cells. The working frequency is 133 MHz at 2.5 V. Experimental results show that the execution time is reduced by 48% in case of four iterations, and by 66% in case of six iterations.

Cited by 6

Efficient Code Excited Linear Predictor Using Redundant Vector Quantiser Representations

Krishnan, V., Mikhael, W. B. · Journal of International Crisis and Risk Communication Research · 2001

The description of a novel linear prediction (LP) model-based coding technique was presented, where the advantages of multiple non-orthogonal domain representations of LP coefficients and the residuals were exploited in conjunction with vector quantisation. The LP model-based coding was applied to speech signals and the resulting improvement in performance was demonstrated in terms of the reconstruction quality. Sample results using speech signals exhibited improved reconstruction quality which was achieved at the cost of a moderate increase in the computation associated with the representation of the signals in multiple domains.

Cited by 0Open access

Identification and Optimization of Redundant Code Using Large Language Models

Shamse Tasnim Cynthia · ArXiv.org · 2025

Redundant code is a persistent challenge in software development that makes systems harder to maintain, scale, and update. It adds unnecessary complexity, hinders bug fixes, and increases technical debt. Despite their impact, removing redundant code manually is risky and error-prone, often introducing new bugs or missing dependencies. While studies highlight the prevalence and negative impact of redundant code, little focus has been given to Artificial Intelligence (AI) system codebases and the common patterns that cause redundancy. Additionally, the reasons behind developers unintentionally introducing redundant code remain largely unexplored. This research addresses these gaps by leveraging large language models (LLMs) to automatically detect and optimize redundant code in AI projects. Our research aims to identify recurring patterns of redundancy and analyze their underlying causes, such as outdated practices or insufficient awareness of best coding principles. Additionally, we plan to propose an LLM agent that will facilitate the detection and refactoring of redundancies on a large scale while preserving original functionality. This work advances the application of AI in identifying and optimizing redundant code, ultimately helping developers maintain cleaner, more readable, and scalable codebases.

Cited by 0Open access

Attack of the clones: an investigation into removing redundant source code

John Oliver Bailey · Durham e-Theses (Durham University) · 2002

Long-term maintenance of code will often lead to the introduction of duplicated or 'cloned' code. Legacy systems riddled with these clones have large amounts of redundant code and are more difficult to understand and maintain. One option available to improve maintainability and to increase software reuse, is to re-engineer code clones into reusable components. However, before this can be achieved detection and removal of this redundant code is necessary. There are several established clone detection tools for software maintenance and this thesis aims to investigate the similarities between their output. It also looks at how maintainers may best use them to reduce the amount of redundant code in a software system. This will be achieved by running clone detection tools on several different case studies. Included in these case studies will be a novel tool called Covet inspired by research of Mayrand [May96b] which attempted to identify cloned routines through a comparison of software metrics generated from each routine. It was found that none of the clone detection tools achieved either 100% precision or 100% recall. Each tool identified very different sets of clones. Overall MOSS achieved the greatest precision and CCFinder the greatest recall. Also observed was that the use of automatically generated code increased the proportion of clones found in a software system.

Cited by 0Open access

Using redundant transactions to verify the correctness of program code execution

Sudhanva Gurumurthi · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 2023

In the described embodiments, a processor core (e.g., a GPU core) receives a section of program code to be executed in a transaction from another entity in a computing device. The processor core sends the section of program code to one or more compute units in the processor core to be executed in a first transaction and concurrently executed in a second transaction, thereby creating a “redundant transaction pair.” When the first transaction and the second transaction are completed, the processor core compares a read-set of the first transaction to a read-set of the second transaction and compares a write-set of the first transaction to a write-set of the second transaction. When the read-sets and the write-sets match and no transactional error condition has occurred, the processor core allows results from the first transaction to be committed to an architectural state of the computing device.

Cited by 0Open access

Objectivity: A Redundant Dimension Of The Management Accountants Code Of Ethics

Richard E. Coppage, Sidney J. Baxendale · Journal of Applied Business Research (JABR) · 2011

A Hallmark of any profession is the presence of a Code of Ethics which can be defined and defended The National Association of Accountants Code of Ethics sets standards for practicing management accountants and students aspiring to become management accountants. This study empirically evaluated the content validity of the current code of ethics. Using Flanagans Critical Incident Technique, interviews were held with 25 Certified Management Accountants from major corporations. The data from the interviews were assembled into a mail questionnaire. Based on responses to the questionnaire, six ethical categories and 191 specific behavior describing the categories were identified and validated. The results provide empirical support for the current code of ethics, with the exception of the Objectivity category. There was a lack of consensus regarding behaviors to be classified to the Objectivity category. The results indicate that the Objectivity standards of the current code are obscure and tend to repeat the Integrity standards. Such results raise the question Are the Objectivity standards of the current code of ethics necessary?

Cited by 0Open access

Multiple description vector quantizer design based on redundant representation of central code

Akinori Ito · 2016

A design method of a multiple description vector quantizer (VQ) is proposed. VQ is widely used for data compression, transmission and other processing. Here, we assume transmission channels with data erasure such as a packet-based network. Multiple description coding is a coding method used to achieve “graceful degradation” when transmitting signals through lossy channels. The proposed method is inspired by the vector quantizer design of Poggi et al., which combines VQ design based on the self-organizing map (SOM) and the multiple description scalar quantizer (MDSQ). The method also uses the SOM-based VQ; the difference is that the proposed method combines a bit-error-tolerant VQ designed by SOM and a novel scheme for cell arrangement of SOM based on Redundant Representation of Central Code (RRCC). The method is not only easy to design for any bit rate but is also more robust against data erasure compared with the conventional VQ.

Cited by 1

Joint source and channel coding/decoding by concatenating an oversampled filter bank code and a redundant entropy code

Slavica Marinkovic, Christine Guillemot · 2005

This paper examines a joint source and channel coding (JSCC) technique based on oversampled filter banks (OFB). We consider an image compression system with an OFB based signal decomposition followed by scalar quantization and a redundant entropy coding scheme. This encoding chain can be viewed as a concatenation of an OFB code and an error correcting entropy code. The error correcting ability of an OFB comes from the explicit redundancy introduced into the transmitted signal by oversampling while the error correcting ability of the entropy code comes from the implicit redundancy due to the Markov property of the OFB outputs. The decoder consists of the soft-input soft-output entropy decoder and a syndrome decoder for the OFB code. The soft information at the output of the entropy decoder is utilized in the error localization procedure of the OFB syndrome decoder. The performance of the algorithm is examined for an image coding system with a wavelet filter bank.

Cited by 3

AOC: An Aspect - Oriented Approach for Comment to Reduce the Redundant Behavior between Source Code and Compilation Code

Siwadol Sateanpattanakul · Journal of Software · 2015

Compiler has the duty to transform the source code to machine code. After the compilation process, there are two types of file was be appear as the former source code and the byte code. The program behaviors exist in two places, source code and machine code. They make repetition of the software engineering process. It means every piece of knowledge must have a single within a system.

Cited by 1Open access

Performance Analysis of Utilizing Reed Solomon Code in Redundant Array of Independent Disk

Zixuan Jiang · 2022

The Redundant array of independent disks (RAID) is a method of storing the same data on multiple hard disks in different places. By placing data on multiple hard disks, I/O operations can overlap in a balanced way, improving performance. RAID utilizes multiple disks to achieve higher data reliability at the cost of reduced storage capacity. RAID6 has become a popular option for RAID disk array due to its capability to recover two disk failures in a setup with two parity disks. A RAID6 setup usually includes several data disks and two parity disks. Although the general setup is similar, in practice there are a variety of encoding scheme to achieve similar effect. Two commonly used coding schemes are Reed-Solomon (RS) code and EVENODD code. This article will discuss the effectiveness of RS code in theory, by calculating the data I/O operation needed to read, write and rebuild disk in both coding schemes, and compare the result against that of EVENODD coding. Simulation of RAID6 structure will also be performed, both under ideal condition and non-ideal condition, to consider the influence of real factor such as degrading disk has on the effectiveness of such RAID structures.

Cited by 2