Projective Parameterized Linear Codes Arising from some Matrices and their Main Parameters
In this paper we will estimate the main parameters of some evaluation codes which are known as projective parameterized codes. We will find the length of these codes and we will give a formula for the dimension in terms of the Hilbert function associated to two ideals, one of them being the vanishin...
Saved in:
Main Authors | , , |
---|---|
Format | Journal Article |
Language | English |
Published |
30.08.2011
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | In this paper we will estimate the main parameters of some evaluation codes
which are known as projective parameterized codes. We will find the length of
these codes and we will give a formula for the dimension in terms of the
Hilbert function associated to two ideals, one of them being the vanishing
ideal of the projective torus. Also we will find an upper bound for the minimum
distance and, in some cases, we will give some lower bounds for the regularity
index and the minimum distance. These lower bounds work in several cases,
particularly for any projective parameterized code associated to the incidence
matrix of uniform clutters and then they work in the case of graphs. |
---|---|
AbstractList | In this paper we will estimate the main parameters of some evaluation codes
which are known as projective parameterized codes. We will find the length of
these codes and we will give a formula for the dimension in terms of the
Hilbert function associated to two ideals, one of them being the vanishing
ideal of the projective torus. Also we will find an upper bound for the minimum
distance and, in some cases, we will give some lower bounds for the regularity
index and the minimum distance. These lower bounds work in several cases,
particularly for any projective parameterized code associated to the incidence
matrix of uniform clutters and then they work in the case of graphs. |
Author | Sarabia, Manuel Gonzalez Marquez, Carlos Renteria Rosales, Eliseo Sarmiento |
Author_xml | – sequence: 1 givenname: Manuel Gonzalez surname: Sarabia fullname: Sarabia, Manuel Gonzalez – sequence: 2 givenname: Carlos Renteria surname: Marquez fullname: Marquez, Carlos Renteria – sequence: 3 givenname: Eliseo Sarmiento surname: Rosales fullname: Rosales, Eliseo Sarmiento |
BackLink | https://doi.org/10.48550/arXiv.1108.6114$$DView paper in arXiv |
BookMark | eNpFj01LxDAURbPQhY7uXUn-QGtemjZ1ORS_oOIsZuWmpOl7GrGpvJRB_fV2HMHVhXvhcM-pOIpTRCEuQOWmLkt15fgz7HIAVecVgDkRzxue3tDPYYdy49iNOCOHbxxkGyI6ls00YJJrDinEF0k8jTJNI8pHN3Pwy-TiIOdXDLxUIf5D0pk4Jvee8PwvV2J7e7Nt7rP26e6hWbeZq0qTaUDTL-esJtLOKm-pUFVpDRU96UF5o7FQBAA9VX6oodeeri2puqygtn2xEpcH7K9b98FhdPzV7R27vWPxA_plTlk |
ContentType | Journal Article |
Copyright | http://arxiv.org/licenses/nonexclusive-distrib/1.0 |
Copyright_xml | – notice: http://arxiv.org/licenses/nonexclusive-distrib/1.0 |
DBID | AKY AKZ GOX |
DOI | 10.48550/arxiv.1108.6114 |
DatabaseName | arXiv Computer Science arXiv Mathematics arXiv.org |
DatabaseTitleList | |
Database_xml | – sequence: 1 dbid: GOX name: arXiv.org url: http://arxiv.org/find sourceTypes: Open Access Repository |
DeliveryMethod | fulltext_linktorsrc |
ExternalDocumentID | 1108_6114 |
GroupedDBID | AKY AKZ GOX |
ID | FETCH-LOGICAL-a654-21e4b48572ff2a70c7f306574f3bf2d0c42e30f111bf6cd81b2cf97f0856187b3 |
IEDL.DBID | GOX |
IngestDate | Mon Jan 08 05:49:46 EST 2024 |
IsDoiOpenAccess | true |
IsOpenAccess | true |
IsPeerReviewed | false |
IsScholarly | false |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-a654-21e4b48572ff2a70c7f306574f3bf2d0c42e30f111bf6cd81b2cf97f0856187b3 |
OpenAccessLink | https://arxiv.org/abs/1108.6114 |
ParticipantIDs | arxiv_primary_1108_6114 |
PublicationCentury | 2000 |
PublicationDate | 2011-08-30 |
PublicationDateYYYYMMDD | 2011-08-30 |
PublicationDate_xml | – month: 08 year: 2011 text: 2011-08-30 day: 30 |
PublicationDecade | 2010 |
PublicationYear | 2011 |
Score | 1.4985486 |
SecondaryResourceType | preprint |
Snippet | In this paper we will estimate the main parameters of some evaluation codes
which are known as projective parameterized codes. We will find the length of
these... |
SourceID | arxiv |
SourceType | Open Access Repository |
SubjectTerms | Computer Science - Information Theory Mathematics - Information Theory |
Title | Projective Parameterized Linear Codes Arising from some Matrices and their Main Parameters |
URI | https://arxiv.org/abs/1108.6114 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwdV07T8MwELZKJxYE4v30wBpInNhORlRRKqRChyJFLJUv8UkdSFFTKsSv5y4JhYXVdizrHPm-e30nxHWmgKwOHwYaSw4zcpAQjAsgA--cS3QEXDs8fjKjl-Qx13lPXP3Uwrjl53zd8gNDfcs56jcm4kbVW0pxxtbDc94GGxsmrm75ZhkhzGbkj4oY7oqdDtvJu_Yy9kTPV_viddL6OuhVkRPHqVDMjvzlS0lmIP1mcrAofU0fzdlql1zuIevFm5fjhjyfpsjWl40_n4bm1e8m9YGYDu-ng1HQNTQInNFJoCKfAJ3bKkTlbFhY5L7tNsEYUJVhkSgfh0ivD6ApSgKUqsDMIqEiE6UW4kPRrxaVPxYSAUi5kWphAIGpcTYGrXVcWkwLD-mJOGoEMXtvOStmLKIZi-j035kzsb1xmIbnor9afvgL0rgruGzk_g19c4KY |
link.rule.ids | 228,230,783,888 |
linkProvider | Cornell University |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Projective+Parameterized+Linear+Codes+Arising+from+some+Matrices+and+their+Main+Parameters&rft.au=Sarabia%2C+Manuel+Gonzalez&rft.au=Marquez%2C+Carlos+Renteria&rft.au=Rosales%2C+Eliseo+Sarmiento&rft.date=2011-08-30&rft_id=info:doi/10.48550%2Farxiv.1108.6114&rft.externalDocID=1108_6114 |