1969
DOI: 10.1109/tit.1969.1054265
|View full text |Cite
|
Sign up to set email alerts
|

A survey of progress in coding theory in the Soviet Union

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1969
1969
2017
2017

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(1 citation statement)
references
References 110 publications
0
1
0
Order By: Relevance
“…It's easy to see that when n = O(d), the protocol is good because of TDMA or FDMA. If we have more users, we can use the idea of arithmetic coding [13], but it's hard to be applied to large system because t times users needs 2 t times power cost for some users. Now we introduce a easily applied protocol which can square the number of users.…”
Section: Encode Information Into Second Momentsmentioning
confidence: 99%
“…It's easy to see that when n = O(d), the protocol is good because of TDMA or FDMA. If we have more users, we can use the idea of arithmetic coding [13], but it's hard to be applied to large system because t times users needs 2 t times power cost for some users. Now we introduce a easily applied protocol which can square the number of users.…”
Section: Encode Information Into Second Momentsmentioning
confidence: 99%