Bounding the Minimum Distance of Affine Variety Codes Using Symbolic Computations of Footprints

Hans Olav Geil; Ferruh Ozbudak

doi:10.1007/978-3-319-66278-7_12

Bounding the Minimum Distance of Affine Variety Codes Using Symbolic Computations of Footprints

Research output: Contribution to book/anthology/report/conference proceeding › Article in proceeding › Research › peer-review

3 Citations (Scopus)

Original language	English
Title of host publication	Coding Theory and Applications : 5th International Castle Meeting, ICMCTA 2017, Vihula, Estonia, August 28-31, 2017, Proceedings
Editors	Á.I. Barbero, V. Skachek, Ø. Ytrehus
Number of pages	11
Publisher	Springer VS
Publication date	2017
Pages	128-138
ISBN (Print)	978-3-319-66277-0
ISBN (Electronic)	978-3-319-66278-7
DOIs	https://doi.org/10.1007/978-3-319-66278-7_12
Publication status	Published - 2017
Event	5th International Castle Meeting on Coding Theory and Applications - , Estonia Duration: 28 Aug 2017 → 31 Aug 2017

Conference

Conference	5th International Castle Meeting on Coding Theory and Applications
Country/Territory	Estonia
Period	28/08/2017 → 31/08/2017

Series	Lecture Notes in Computer Science
Volume	10495
ISSN	0302-9743

Access to Document

10.1007/978-3-319-66278-7_12

AUB Link

Search for the material in Aalborg University Library's search engine

Cite this

Geil, H. O., & Ozbudak, F. (2017). Bounding the Minimum Distance of Affine Variety Codes Using Symbolic Computations of Footprints. In Á. I. Barbero, V. Skachek, & Ø. Ytrehus (Eds.), Coding Theory and Applications: 5th International Castle Meeting, ICMCTA 2017, Vihula, Estonia, August 28-31, 2017, Proceedings (pp. 128-138). Springer VS. https://doi.org/10.1007/978-3-319-66278-7_12

Geil, Hans Olav ; Ozbudak, Ferruh. / Bounding the Minimum Distance of Affine Variety Codes Using Symbolic Computations of Footprints. Coding Theory and Applications: 5th International Castle Meeting, ICMCTA 2017, Vihula, Estonia, August 28-31, 2017, Proceedings. editor / Á.I. Barbero ; V. Skachek ; Ø. Ytrehus. Springer VS, 2017. pp. 128-138 (Lecture Notes in Computer Science, Vol. 10495).

@inproceedings{f85fd662a9f44eee9c6ce8a1e4001a29,

title = "Bounding the Minimum Distance of Affine Variety Codes Using Symbolic Computations of Footprints",

author = "Geil, {Hans Olav} and Ferruh Ozbudak",

year = "2017",

doi = "10.1007/978-3-319-66278-7_12",

language = "English",

isbn = "978-3-319-66277-0",

series = "Lecture Notes in Computer Science",

publisher = "Springer VS",

pages = "128--138",

editor = "{\'A}.I. Barbero and V. Skachek and {\O}. Ytrehus",

booktitle = "Coding Theory and Applications",

note = "5th International Castle Meeting on Coding Theory and Applications, ICMCTA ; Conference date: 28-08-2017 Through 31-08-2017",

}

Geil, HO & Ozbudak, F 2017, Bounding the Minimum Distance of Affine Variety Codes Using Symbolic Computations of Footprints. in ÁI Barbero, V Skachek & Ø Ytrehus (eds), Coding Theory and Applications: 5th International Castle Meeting, ICMCTA 2017, Vihula, Estonia, August 28-31, 2017, Proceedings. Springer VS, Lecture Notes in Computer Science, vol. 10495, pp. 128-138, 5th International Castle Meeting on Coding Theory and Applications, Estonia, 28/08/2017. https://doi.org/10.1007/978-3-319-66278-7_12

Bounding the Minimum Distance of Affine Variety Codes Using Symbolic Computations of Footprints. / Geil, Hans Olav; Ozbudak, Ferruh.
Coding Theory and Applications: 5th International Castle Meeting, ICMCTA 2017, Vihula, Estonia, August 28-31, 2017, Proceedings. ed. / Á.I. Barbero; V. Skachek; Ø. Ytrehus. Springer VS, 2017. p. 128-138 (Lecture Notes in Computer Science, Vol. 10495).

Research output: Contribution to book/anthology/report/conference proceeding › Article in proceeding › Research › peer-review

TY - GEN

T1 - Bounding the Minimum Distance of Affine Variety Codes Using Symbolic Computations of Footprints

AU - Geil, Hans Olav

AU - Ozbudak, Ferruh

PY - 2017

Y1 - 2017

U2 - 10.1007/978-3-319-66278-7_12

DO - 10.1007/978-3-319-66278-7_12

M3 - Article in proceeding

SN - 978-3-319-66277-0

T3 - Lecture Notes in Computer Science

SP - 128

EP - 138

BT - Coding Theory and Applications

A2 - Barbero, Á.I.

A2 - Skachek, V.

A2 - Ytrehus, Ø.

PB - Springer VS

T2 - 5th International Castle Meeting on Coding Theory and Applications

Y2 - 28 August 2017 through 31 August 2017

ER -

Geil HO, Ozbudak F. Bounding the Minimum Distance of Affine Variety Codes Using Symbolic Computations of Footprints. In Barbero ÁI, Skachek V, Ytrehus Ø, editors, Coding Theory and Applications: 5th International Castle Meeting, ICMCTA 2017, Vihula, Estonia, August 28-31, 2017, Proceedings. Springer VS. 2017. p. 128-138. (Lecture Notes in Computer Science, Vol. 10495). doi: 10.1007/978-3-319-66278-7_12