English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Maximum distance profile (MDP) convolutional codes have the property that their column distances are as large as possible for given rate and degree. There exists a well-known criterion to check whether a code is MDP using the generator or the parity-check matrix of the code. In this paper, we show that under the assumption that [Formula: see text] divides [Formula: see text] or [Formula: see text] divides [Formula: see text], a polynomial matrix that fulfills the MDP criterion is actually always left prime. In particular, when [Formula: see text] divides [Formula: see text], this implies that each MDP convolutional code is noncatastrophic. Moreover, when [Formula: see text] and [Formula: see text] do not divide [Formula: see text], we show that the MDP criterion is in general not enough to ensure left primeness. In this case, with one more assumption, we still can guarantee the result.

On the left primeness of some polynomial matrices with applications to convolutional codes