Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

A. Donald Keedwell

dblp:37/1684 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 1990
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Coding theory · 61% Algorithms and data structures · 30% Combinatorics and discrete mathematics · 9%
Computer networks
1 paper
Cellular and mobile networks · 75% Wireless networking · 25%
Network and information security
1 paper
Cryptographic protocols and secure computation · 100%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation
secret sharing
0.011990
On Golomb-Posner codes and a remark of W.W. Wu about secret-sharing systems · IEEE Trans. Commun. 1990
Coding theory › error-correcting codes › combinatorial coding theory
combinatorial codes
0.011990
A new construction of two-dimensional arrays with the window property · IEEE Trans. Inf. Theory 1990
Coding theory › error-correcting codes
reed-solomon codes
0.011990
On Golomb-Posner codes and a remark of W.W. Wu about secret-sharing systems · IEEE Trans. Commun. 1990
Algorithms and data structures
two-dimensional arrays
0.011990
A new construction of two-dimensional arrays with the window property · IEEE Trans. Inf. Theory 1990
Wireless networking › cognitive radio › spectrum management
frequency assignment
0.011988
Frequency allocation for a mobile radio telephone system · IEEE Trans. Commun. 1988
Cellular and mobile networks
frequency reuse
0.011988
Frequency allocation for a mobile radio telephone system · IEEE Trans. Commun. 1988
Cellular and mobile networks
mobility management
0.011988
Frequency allocation for a mobile radio telephone system · IEEE Trans. Commun. 1988
Cellular and mobile networks
radio access networks
0.011988
Frequency allocation for a mobile radio telephone system · IEEE Trans. Commun. 1988
Combinatorics and discrete mathematics › combinatorial design
latin squares
0.011990
A new construction of two-dimensional arrays with the window property · IEEE Trans. Inf. Theory 1990

Methods — techniques the papers use, named apart from their topics

latin squares · 0.0combinatorial design · 0.0combinatorial construction · 0.0
YearPublicationVenuePosition
1990 On Golomb-Posner codes and a remark of W.W. Wu about secret-sharing systems
abstract
In a recent book (Elements of Digital Satellite Communication, vol.II, 1985), W.W. Wu has shown that all the secret-sharing systems known at the time his book was written can be described in terms of Reed-Solomon codes. He has also remarked that all are connected with latin squares and has illustrated this remark by means of examples. However, his examples construct secret-sharing systems in which the secret can be unlocked with only two keys. It is shown here that this is necessarily the case when latin squares are used. For this purpose. Wu's observations are replaced by a theorem, one which also shows a connection with Golomb-Posner codes.>
József Dénes, A. Donald Keedwell
IEEE Trans. Commun.2
1990 A new construction of two-dimensional arrays with the window property
abstract
It is shown how row-complete Latin squares and Tuscan squares can be used to construct nonbinary 1-D and 2-D arrays that have the u*v horizontal and/or vertical window property for all sufficiently large windows. It is shown how binary arrays with a similar property can be derived. Since an array can only be a perfect map for one particular size of window, the arrays that are constructed are not perfect but nevertheless have several practical applications, among others in connection with the coding and transmission of pictures. The method is deterministic rather than stochastic, and the arrays derived contain an effectively random selection of the windows of each relevant size.>
József Dénes, A. Donald Keedwell
IEEE Trans. Inf. Theory2
1988 Frequency allocation for a mobile radio telephone system
abstract
Several ways of allocating frequencies efficiently are suggested that are based on the use of Latin squares. A Latin square of order n is a square array of n rows and n columns, and involving n symbols each of which occurs n times within the square in such a way that all the different symbols occur once in each row and once in each column. This approach provides two alternative ways of arranging the transmitters for a mobile radio telephone system, one rectangular and the other close-packed hexagonal. In both cases optimal patterns for frequency allocation result. A solution using the least-possible number of frequencies for each case is given, as well as one that is ideal in the sense that all the transmitters that surround any particular one are provided with distinct frequencies.>
József Dénes, A. Donald Keedwell
IEEE Trans. Commun.2