Add to ORKGconstructed using a product of two codes of smaller dimensions. The proposed code is of dimension 17 and of size 8192, i.e., with 2^13 codewords. The best known code of dimension 17 has size 7968 and capable of handling 12 information bits only. The only other three known cases of single asymmeteric codes accommodating one more extra information bit than the symmetric case are for code dimensions 2, 4, and 1
We prove that the cyclic and constacyclic codes constructed by Grassl and R\"otteler in arXiv:1502.0...
In this small note we correct an error made by Mohammadi et al. in their paper entitled "On Skew Cyc...
A new generalization of Reed-Solomon codes is given. This new generalization has similar information...
constructed using a product of two codes of smaller dimensions. The proposed code is of dimension 17...
New single asymmetric error-correcting codes are proposed. These codes are better than existing code...
A new single asymmetric error-correcting code is proposed. This code is constructed using a product ...
A new code capable of correcting a single asymmetric error is proposed. This code is of length 19 an...
This paper presents a class of integer codes capable of correcting single asymmetric errors. The pre...
AbstractAn asymmetric binary covering code of length n and radius R is a subset C of the n-cube Qn s...
The purpose of this paper is to introduce new linear codes with generalized symmetry. We extend cyc...
AbstractFor a prime power q, let αq be the standard function in the asymptotic theory of codes, that...
Constantin and Rao [(1979), Inform. Contr. 40, 2036] have given an ingenious construction for a clas...
AbstractIn this paper we study an analogue of perfect codes: codes that perfectly correct errors of ...
For q,n,d∈N, let Aq(n,d) be the maximum size of a code C⊆[q]n with minimum distance at least d. We g...
Graduation date: 1982Historically, coding theory has dealt with binary\ud codes correcting symmetric...
We prove that the cyclic and constacyclic codes constructed by Grassl and R\"otteler in arXiv:1502.0...
In this small note we correct an error made by Mohammadi et al. in their paper entitled "On Skew Cyc...
A new generalization of Reed-Solomon codes is given. This new generalization has similar information...
constructed using a product of two codes of smaller dimensions. The proposed code is of dimension 17...
New single asymmetric error-correcting codes are proposed. These codes are better than existing code...
A new single asymmetric error-correcting code is proposed. This code is constructed using a product ...
A new code capable of correcting a single asymmetric error is proposed. This code is of length 19 an...
This paper presents a class of integer codes capable of correcting single asymmetric errors. The pre...
AbstractAn asymmetric binary covering code of length n and radius R is a subset C of the n-cube Qn s...
The purpose of this paper is to introduce new linear codes with generalized symmetry. We extend cyc...
AbstractFor a prime power q, let αq be the standard function in the asymptotic theory of codes, that...
Constantin and Rao [(1979), Inform. Contr. 40, 2036] have given an ingenious construction for a clas...
AbstractIn this paper we study an analogue of perfect codes: codes that perfectly correct errors of ...
For q,n,d∈N, let Aq(n,d) be the maximum size of a code C⊆[q]n with minimum distance at least d. We g...
Graduation date: 1982Historically, coding theory has dealt with binary\ud codes correcting symmetric...
We prove that the cyclic and constacyclic codes constructed by Grassl and R\"otteler in arXiv:1502.0...
In this small note we correct an error made by Mohammadi et al. in their paper entitled "On Skew Cyc...
A new generalization of Reed-Solomon codes is given. This new generalization has similar information...