- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications.

- Abdollah Khodkar
- Australasian J. Combinatorics
- 1994

In this note the existence of a (Vj P2j 4, 2) BTD I for P2 = 0, 1 and 2, in which any pair of blocks intersect in at most two elements, is proved for any admissible v. A balanced ternary design is a… (More)

- Peter Adams, Darryn E. Bryant, Abdollah Khodkar
- Discrete Mathematics
- 2000

Abstract For m,n even and n>m , the obvious necessary conditions for the existence of a decomposition of the complete graph K v when v is odd (or the complete graph with a 1-factor removed K v ⧹F… (More)

- Jovan Dj. Golic, Mahmoud Salmasizadeh, Andrew J. Clark, Abdollah Khodkar, Ed Dawson
- Cryptography: Policy and Algorithms
- 1995

Modifications to fast correlation attacks on stream ciphers are investigated. Improvements are achieved with both deterministic and random choices for updates of the corresponding posterior… (More)

SummaryWe prove that forv = 1 and for allv ≡ 1 (mod 3),v ≥ 10, there is a (v, 4, 4) design with the property that no triple appears in more than one block. The proof of this result is made more… (More)

- Diane Donovan, James G. Lefevre, Thomas A. McCourt, Nicholas J. Cavenagh, Abdollah Khodkar
- Australasian J. Combinatorics
- 2012

In this paper we answer a question in theoretical cryptography by re- ducing it to a seemingly unrelated geometrical problem. Drapal (1991) showed that a given partition of an equilateral triangle of… (More)

- Peter Adams, Richard Bean, Abdollah Khodkar
- Ars Comb.
- 2003

A critical set in a Latin square of order n is a set of entries from the square which can be embedded in precisely one Latin square of order n, Such that if any element of the critical set. is… (More)

- A. N. Ghameshlou, Abdollah Khodkar, Seyed Mahmoud Sheikholeslami
- Discrete Math., Alg. and Appl.
- 2011

The closed neighborhood NG[v] of a vertex v in a graph G is the set consisting of v and of all neighborhood vertices of v. Let f be a function on V(G), the vertex set of G, into the set {-1, 1}. If… (More)

A new decoding algorithm for burst errors in Reed-Solomon codes is given. This algorithm is shown to be more efficient than previously proposed methods.

- Hosein Karami, Seyed Mahmoud Sheikholeslami, Abdollah Khodkar
- Discrete Mathematics
- 2009

A numerical invariant of directed graphs concerning domination which is named signed domination number @c"S is studied in this paper. We present some sharp lower bounds for @c"S in terms of the… (More)