Nguyen Huong Lam - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 17 from 17

2004

Asymptotically Optimal Low-Cost Solid CodesHelmut Jürgensen, Stavros Konstantinidis, Nguyen Huong Lam. jalc, 9(1):81-102, 2004.

Finite Completion of comma-free codes. Part 1Nguyen Huong Lam. ita, 38(2):91-115, 2004. [doi]

Finite Completion of comma-free codes. Part 2Nguyen Huong Lam. ita, 38(2):117-136, 2004. [doi]

2003

Completing comma-free codesNguyen Huong Lam. TCS, 1-3(301):399-415, 2003. [doi]

2002

Finite Completion of Comma-Free Codes. Part INguyen Huong Lam. dlt 2003: 357-368 [doi]

2001

Finite maximal solid codesNguyen Huong Lam. TCS, 262(1):333-347, 2001. [doi]

1999

Unavoidable set: extension and reductionPhan Trung Huy, Nguyen Huong Lam. ita, 33(3):213-226, 1999.

1997

Hajós Factorizations and Completion of CodesNguyen Huong Lam. TCS, 182(1-2):245-256, 1997. [doi]

1996

On Codes Having no Finite CompletionNguyen Huong Lam. ita, 30(6):483-493, 1996.

1995

On Codes Having no Finite CompletionNguyen Huong Lam. ita, 29(2):145-155, 1995.

A Note on Codes Having no Finite CompletionsNguyen Huong Lam. ipl, 55(4):185-188, 1995. [doi]

1994

On Codes Having no Finite CompletionNguyen Huong Lam. STACS 1994: 691-698

Measure of Infinitary CodesNguyen Huong Lam, Do Long Van. actaC, 11(3):127-138, 1994. [doi]

1993

On Codes of Bi-Infinite WordsDo Long Van, Nguyen Huong Lam, Phan Trung Huy. actaC, 11(1-2):97-110, 1993. [doi]

1991

On Strict CodesNguyen Huong Lam, Do Long Van. actaC, 10(1-2):25-34, 1991. [doi]

On Strict CodesNguyen Huong Lam, Do Long Van. mfcs 1991: 308-317

1990

On a class of infiinitary codesNguyen Huong Lam, Do Long Van. ita, 24:441-458, 1990.

Sign in or sign up to see more results.

runs on WebDSL