| 1. |
- Chen, Eric Zhi, 1963-
(författare)
-
Further results on difference triangle sets
- 1994
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448 .- 1557-9654. ; 40:4, s. 1268-1270
-
Tidskriftsartikel (refereegranskat)abstract
- Further results on the upper bounds for difference tri8nglesets (DTS) are derived from disjoint difference sets and additive sequencesof permutations, whit3 greatly improve the known bounds.
|
|
| 2. |
- Chen, Eric Zhi, 1963-
(författare)
-
Six new binary quasi-cyclic codes
- 1994
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448 .- 1557-9654. ; 40:5, s. 1666-1667
-
Tidskriftsartikel (refereegranskat)abstract
- Six new quasi-cyclic codes are presented, which improve thelower bounds on the minimum distance for a binary code. A localexhaustive search is used to find these codes and many other quasi-cycliccodes which attain the lower bounds.
|
|
| 3. |
- Johansson, Thomas
(författare)
-
Lower bounds on the probability of deception in authentication with arbitration
- 1994
-
Ingår i: IEEE Transactions on Information Theory. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9448. ; 40:5, s. 1573-1585
-
Tidskriftsartikel (refereegranskat)abstract
- The paper investigates a model for authentication in which not only an outsider, but also the transmitter or the receiver, may cheat. Lower bounds on the probability of success for different types of deception as well as on the parameters of secure authentication codes are derived. The latter bounds are shown to be tight by demonstrating codes in projective space that meet the bounds with equality.
|
|
| 4. |
|
|
| 5. |
- Smeets, Ben
(författare)
-
Bounds on the probability of deception in multiple authentication
- 1994
-
Ingår i: IEEE Transactions on Information Theory. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9448. ; 40:5, s. 1586-1591
-
Tidskriftsartikel (refereegranskat)abstract
- The frequently assumed "freshness" constraint on the source states in multiple authentication schemes is not necessary if one allows the encoding rule to change between subsequent transmissions. In the paper it is shown that the main existing lower bounds on the probabilities of successful attack on multiple authentication schemes also hold for this new setup. Furthermore, Stinson's (1988) bound for the substitution attack is strengthened
|
|
| 6. |
- Wan, Zhe-Xian, et al.
(författare)
-
On the construction of Cartesian authentication codes over symplectic spaces
- 1994
-
Ingår i: IEEE Transactions on Information Theory. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9448. ; 40:3, s. 920-929
-
Tidskriftsartikel (refereegranskat)abstract
- Various constructions of authentication codes using spaces related to the general linear group have been proposed and analyzed. In the paper the authors describe two new constructions of Cartesian authentication codes using symplectic spaces. This illustrates the feasibility of codes from spaces based on geometries of the other classical groups.
|
|
