In this paper we generalize the concept of geometrically uniform codes, formerly employed in Euclidean spaces, to hyperbolic spaces. We also show a characterization of generalized coset codes through the concept of G-linear codes
In this paper we present a generalization of the perfect codes derived from the quotient rings of Ga...
AbstractA method is established to convert results from finite geometries to error-correcting codes....
MRD-codes and various geometric objects as linearized polynomials, linear sets of PG(n −1, qn), and ...
In this paper we generalize the concept of geometrically uniform codes, formerly employed in Euclide...
This dissertation is an extended text resulting from the study of paper [14] by Lazari & Palazzo Jr...
In this paper we establish the connections between two different extensions Of Z(4)-linearity for bi...
Geometrically uniform codes are fundamental in communication systems, mainly for modulation. Typical...
Resumo: O presente trabalho tem como meta principal construir constelações de sinais geometricamente...
In this correspondence, in an extension of Piret's bound for codes over phase-shift keying (PSK) sig...
The theory of geometrically uniform signal sets and codes over groups is applied to the case of LxMP...
AbstractWe describe three new methods for obtaining superimposed codes in Euclidean spaces. With hel...
AbstractFor many codes defined geometrically over Fq (e.g. coming from a finite complete intersectio...
Abstract- We extend Piret's u p p e r bound [l] to codes over uniform signal sets (a signal set...
The aim of the paper is to expose the general laws for distribution of code words over hypercube edg...
We extend Piret's upper bound [1] to codes over uniform signal sets (a signal set is referred to be ...
In this paper we present a generalization of the perfect codes derived from the quotient rings of Ga...
AbstractA method is established to convert results from finite geometries to error-correcting codes....
MRD-codes and various geometric objects as linearized polynomials, linear sets of PG(n −1, qn), and ...
In this paper we generalize the concept of geometrically uniform codes, formerly employed in Euclide...
This dissertation is an extended text resulting from the study of paper [14] by Lazari & Palazzo Jr...
In this paper we establish the connections between two different extensions Of Z(4)-linearity for bi...
Geometrically uniform codes are fundamental in communication systems, mainly for modulation. Typical...
Resumo: O presente trabalho tem como meta principal construir constelações de sinais geometricamente...
In this correspondence, in an extension of Piret's bound for codes over phase-shift keying (PSK) sig...
The theory of geometrically uniform signal sets and codes over groups is applied to the case of LxMP...
AbstractWe describe three new methods for obtaining superimposed codes in Euclidean spaces. With hel...
AbstractFor many codes defined geometrically over Fq (e.g. coming from a finite complete intersectio...
Abstract- We extend Piret's u p p e r bound [l] to codes over uniform signal sets (a signal set...
The aim of the paper is to expose the general laws for distribution of code words over hypercube edg...
We extend Piret's upper bound [1] to codes over uniform signal sets (a signal set is referred to be ...
In this paper we present a generalization of the perfect codes derived from the quotient rings of Ga...
AbstractA method is established to convert results from finite geometries to error-correcting codes....
MRD-codes and various geometric objects as linearized polynomials, linear sets of PG(n −1, qn), and ...
DOI
Add to ORKG