Entry deFelice:1989:CFF from tcs1985.bib
Last update: Thu Sep 27 02:46:57 MDT 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{deFelice:1989:CFF,
author = "Clelia {de Felice}",
title = "Construction of a family of finite maximal codes",
journal = j-THEOR-COMP-SCI,
volume = "63",
number = "2",
pages = "157--184",
month = feb,
year = "1989",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ de Paris",
affiliationaddress = "Paris, Fr",
classification = "723; B6120B (Codes); C1260 (Information theory)",
corpsource = "Paris VII Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "algorithm; codes; Codes, Symbolic; Computer
Programming--Algorithms; Construction; Factorization;
finite maximal code; Finite Maximal Codes; finite
maximal codes; Two Letter Alphabets; Variable Length
Codes",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- Algorithms, Programming-,
58(0)3,
58(1)3,
58(1)103,
58(1)143,
58(1)183,
59(1)115,
59(3)297,
60(3)255,
60(3)341,
62(0)3,
62(1)67,
62(1)105,
62(1)123,
63(3)295,
64(1)39,
64(1)83,
64(1)107,
64(3)343,
65(1)1,
66(2)157,
66(2)181,
67(1)65
- alphabet,
35(2)179,
35(2)227,
35(2)295,
37(3)357,
38(1)137,
39(2)171,
41(1)109,
46(2)175,
51(3)301,
52(1)1,
56(2)233,
60(3)255,
61(2)279,
63(1)1,
63(3)333,
65(2)143,
65(2)153,
67(1)19,
67(1)121,
69(3)319
- B6120B,
38(1)123,
40(1)3,
41(2)215,
48(2)283,
51(1)215,
54(2)165,
56(3)339,
58(1)103,
66(1)45,
68(3)253
- C1260,
35(2)295,
36(1)99,
37(1)77,
41(2)215,
48(2)283,
51(1)215,
54(2)165,
56(3)339,
57(1)97,
57(1)131,
57(2)283,
58(1)103,
63(2)185,
65(2)143,
65(2)171,
65(2)249,
65(2)z,
68(2)175
- code,
35(2)295,
36(1)99,
36(2)173,
38(1)123,
40(1)3,
41(1)61,
41(2)215,
41(2)289,
48(2)283,
51(1)215,
54(2)165,
56(1)59,
56(3)339,
57(2)283,
58(1)103,
65(0)123,
65(2)171,
65(2)265,
66(1)27,
66(1)45,
68(3)239,
68(3)253
- construction,
36(1)99,
37(3)269,
39(1)3,
40(2)315,
43(1)43,
44(2)229,
54(2)165,
61(2)121,
61(2)225,
65(2)171,
68(2)175
- factorization,
49(1)1,
68(3)347
- family,
36(2)345,
39(2)239,
39(2)281,
44(1)111,
54(2)165,
55(2)183,
58(1)69,
60(3)341,
61(2)175,
63(1)19,
67(1)111,
68(2)155
- information,
35(2)295,
36(1)99,
37(1)77,
41(2)215,
43(2)149,
44(1)69,
48(2)283,
49(2)171,
49(2)185,
51(1)215,
54(2)165,
56(3)339,
57(1)97,
57(1)131,
57(2)283,
58(1)103,
62(1)3,
62(1)39,
62(3)251,
63(1)91,
63(2)185,
65(1)85,
65(2)143,
65(2)171,
65(2)249,
65(2)z,
68(2)175,
68(3)239
- length,
35(1)71,
41(1)19,
54(2)139,
56(2)243,
60(3)255,
68(1)1
- Letter,
63(1)1
- maximal,
36(1)99,
38(1)1,
40(1)3,
43(2)149,
53(2)187,
56(3)339,
58(1)103,
61(1)33,
64(1)125,
64(3)221
- Programming--Algorithms,
58(0)3,
58(1)3,
58(1)103,
58(1)143,
58(1)183,
59(1)115,
59(3)297,
60(3)255,
60(3)341,
62(0)3,
62(1)67,
62(1)105,
62(1)123,
63(3)295,
64(1)39,
64(1)83,
64(1)107,
64(3)343,
65(1)1,
66(2)157,
66(2)181,
67(1)65
- symbolic,
44(1)17,
58(1)103,
65(0)123,
65(2)131,
65(2)243,
65(2)265,
65(2)z
- two,
37(1)51,
38(2)167,
40(2)319,
46(1)101,
47(2)191,
47(3)237,
49(1)81,
58(1)17,
58(1)361,
61(1)67,
62(3)235,
63(1)1,
63(2)141,
64(1)39,
66(3)233
- variable,
36(1)71,
36(2)239,
45(2)159,
53(2)345,
66(1)113,
69(3)243