SCIENTIFIC ABSTRACT LEVENSHTEYN, V.I. - LEVENSON, Y.M.

• Document Type: CREST
• Collection: Scientific Abstracts
• Document Number (FOIA) /ESDN (CREST): CIA-RDP86-00513R000929510009-6
• Release Decision: RIF
• Original Classification: S
• Document Page Count: 100
• Document Creation Date: November 2, 2016
• Document Release Date: August 23, 2000
• Sequence Number: 9
• Publication Date: December 31, 1967
• Content Type: SCIENTIFIC ABSTRACT

e m t
4N
W
29613
3102016 /'40/006/007/030
B125/B-02
AUTHORs Levenshteyn, V. I.
TITLEt Some properties of -.ode systems
PERIODICALt Akademiya nauk SSSR. Doklady v. 140, no. 6, 1961,
1274 - 1277
TEXTs The author found the following new aLd simpler algorithmst
Theorem Is For the uniqueness of decoding of a code system it is neces-
sary and sufficient that none of the classes R rl (V) ~;or_ain elementary
codes for 1 4n4min(N(V)N(Vj*)) - 1. Theorem 21 In order that a code
system having the property of unlq~;e de~_,odlng have th? property of limited
delay, it is necessary and sufficient that a --ertain class R n(V) be empty
for n< V + 1. If this code does have, the propertj of limited delay,
n n + I
one h [ I max where-, r., is the number of the first
-- 21 min 4~,Td*~ -2.
empty class R Mv andA -X-fiin~k(v max ~_(V,)- Theorem 3t
n MIL max
Card 1/5

Some properties of code...
2981-3
3/020/6',/140/006/007/030
B,25/B'02
In order that a code system having the pro;qrty of unique decoding have
,,synchronizaticn, it is ne,~es3ary and suffIcient that a
the property oj
certain class R n(V) be empty for n