Add to ORKGThis paper presents lower bounds on the number of parity-check digits required for a linear code that is capable of detecting errors which are ‘m-repeated burst errors’. Further, codes capable of detecting and simultaneously correcting such errors have also been studied
This paper studies linear codes capable of detecting and correcting solid burst error of length b or...
Abstract. In coding theory, several kinds of errors which depend on the nature of the communication ...
Lee weight is more appropriate for some practical situations than Hamming weight. Bounds over the nu...
There are several kinds of burst errors for which error detecting and error correcting codes have be...
Error correcting codes are required to ensure reliable communication of digitally encoded informatio...
This paper studies linear codes capable of detecting and correcting solid burst error of length b or...
During the digital transmission of information, errors are bound to occur. The errors may be random ...
During the digital transmission of information, errors are bound to occur. The errors may be random ...
The paper presents lower and upper bounds on the number of parity check digits required for a linear...
In this paper, we study linear codes capable of detecting and correcting s-periodic errors. Lower an...
The paper gives necessary and sufficient conditions for the existence of linear codes capable of ide...
AbstractThis paper presents lower and upper bounds on the number of parity-check digits required for...
[[abstract]]This paper presents upper bound on the number of parity-check digits required for linear...
A class of cyclic product codes capable of correcting multiple-burst errors is studied. A code of di...
In this paper, we present bounds on check symbols required for the codes capable to detect as well a...
This paper studies linear codes capable of detecting and correcting solid burst error of length b or...
Abstract. In coding theory, several kinds of errors which depend on the nature of the communication ...
Lee weight is more appropriate for some practical situations than Hamming weight. Bounds over the nu...
There are several kinds of burst errors for which error detecting and error correcting codes have be...
Error correcting codes are required to ensure reliable communication of digitally encoded informatio...
This paper studies linear codes capable of detecting and correcting solid burst error of length b or...
During the digital transmission of information, errors are bound to occur. The errors may be random ...
During the digital transmission of information, errors are bound to occur. The errors may be random ...
The paper presents lower and upper bounds on the number of parity check digits required for a linear...
In this paper, we study linear codes capable of detecting and correcting s-periodic errors. Lower an...
The paper gives necessary and sufficient conditions for the existence of linear codes capable of ide...
AbstractThis paper presents lower and upper bounds on the number of parity-check digits required for...
[[abstract]]This paper presents upper bound on the number of parity-check digits required for linear...
A class of cyclic product codes capable of correcting multiple-burst errors is studied. A code of di...
In this paper, we present bounds on check symbols required for the codes capable to detect as well a...
This paper studies linear codes capable of detecting and correcting solid burst error of length b or...
Abstract. In coding theory, several kinds of errors which depend on the nature of the communication ...
Lee weight is more appropriate for some practical situations than Hamming weight. Bounds over the nu...