Last update: Sun Oct 15 02:56:11 MDT 2017
@Article{Lam:1997:HFC,
author = "Nguyen Huong Lam",
title = "{Haj{\'o}s} factorizations and completion of codes",
journal = j-THEOR-COMP-SCI,
volume = "182",
number = "1--2",
pages = "245--256",
day = "15",
month = aug,
year = "1997",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:21:05 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=182&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1997&volume=182&issue=1-2&aid=2568",
acknowledgement = ack-nhfb,
classification = "B6120B (Codes); C1260 (Information theory)",
corpsource = "Hanoi Inst. of Math., Viet Nam",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "codes; completion of codes; d-code; finitely
completable; Hajos factorizations",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}