  We consider multi-access coded caching problem introduced by Hachem et.al.,
where each user has access to $L$ neighboring caches in a cyclic wrap-around
fashion. We focus on the deterministic schemes for a specific class of
multi-access coded caching problem based on the concept of PDA. We construct
new PDAs which specify the delivery scheme for the specific class of
multi-access coded caching problem discussed in this paper. For the proposed
scheme, the coding gain is larger than that of the state-of-the-art while the
sub-packetization level varies only linearly with the number of users. Hence,
we achieve a lower transmission rate with the least sub-packetization level
compared to the existing schemes.
