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

Publikation: Bidrag til bog/antologi/rapport/konference proceedingKonferenceartikel i proceedingForskningpeer review

3 Citationer (Scopus)
OriginalsprogEngelsk
TitelCoding Theory and Applications : 5th International Castle Meeting, ICMCTA 2017, Vihula, Estonia, August 28-31, 2017, Proceedings
RedaktørerÁ.I. Barbero, V. Skachek, Ø. Ytrehus
Antal sider11
ForlagSpringer VS
Publikationsdato2017
Sider128-138
ISBN (Trykt)978-3-319-66277-0
ISBN (Elektronisk)978-3-319-66278-7
DOI
StatusUdgivet - 2017
Begivenhed5th International Castle Meeting on Coding Theory and Applications - , Estland
Varighed: 28 aug. 201731 aug. 2017

Konference

Konference5th International Castle Meeting on Coding Theory and Applications
LandEstland
Periode28/08/201731/08/2017
NavnLecture Notes in Computer Science
Vol/bind10495
ISSN0302-9743

Citer dette

Geil, H. O., & Ozbudak, F. (2017). Bounding the Minimum Distance of Affine Variety Codes Using Symbolic Computations of Footprints. I Á. I. Barbero, V. Skachek, & Ø. Ytrehus (red.), Coding Theory and Applications: 5th International Castle Meeting, ICMCTA 2017, Vihula, Estonia, August 28-31, 2017, Proceedings (s. 128-138). Springer VS. Lecture Notes in Computer Science, Bind. 10495 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. red. / Á.I. Barbero ; V. Skachek ; Ø. Ytrehus. Springer VS, 2017. s. 128-138 (Lecture Notes in Computer Science, Bind 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",

}

Geil, HO & Ozbudak, F 2017, Bounding the Minimum Distance of Affine Variety Codes Using Symbolic Computations of Footprints. i ÁI Barbero, V Skachek & Ø Ytrehus (red), Coding Theory and Applications: 5th International Castle Meeting, ICMCTA 2017, Vihula, Estonia, August 28-31, 2017, Proceedings. Springer VS, Lecture Notes in Computer Science, bind 10495, s. 128-138, 5th International Castle Meeting on Coding Theory and Applications, Estland, 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. red. / Á.I. Barbero; V. Skachek; Ø. Ytrehus. Springer VS, 2017. s. 128-138 (Lecture Notes in Computer Science, Bind 10495).

Publikation: Bidrag til bog/antologi/rapport/konference proceedingKonferenceartikel i proceedingForskningpeer 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

ER -

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