Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ISIT
/
Paper
A branch and cut algorithm for finding the minimum distance of a linear block code.
Ahmet B. Keha
,
Tolga M. Duman
Venue
B
ISIT
Year
2008
Proceedings
ISIT
DBLP record
conf/isit/KehaD08 ↗
Browse the full
ISIT paper archive
.