Partial permutation decoding for binary linear and $$Z_4$$ Z 4 -linear Hadamard codes

Partial permutation decoding for binary linear and $$Z_4$$ Z 4 -linear Hadamard codes In this paper, s- $${\text {PD}}$$ PD -sets of minimum size $$s+1$$ s + 1 for partial permutation decoding for the binary linear Hadamard code $$H_m$$ H m of length $$2^m$$ 2 m , for all $$m\ge 4$$ m ≥ 4 and $$2 \le s \le \lfloor {\frac{2^m}{1+m}}\rfloor -1$$ 2 ≤ s ≤ ⌊ 2 m 1 + m ⌋ - 1 , are constructed. Moreover, recursive constructions to obtain s- $${\text {PD}}$$ PD -sets of size $$l\ge s+1$$ l ≥ s + 1 for $$H_{m+1}$$ H m + 1 of length $$2^{m+1}$$ 2 m + 1 , from an s- $${\text {PD}}$$ PD -set of the same size for $$H_m$$ H m , are also described. These results are generalized to find s- $${\text {PD}}$$ PD -sets for the $${\mathbb {Z}}_4$$ Z 4 -linear Hadamard codes $$H_{\gamma , \delta }$$ H γ , δ of length $$2^m$$ 2 m , $$m=\gamma +2\delta -1$$ m = γ + 2 δ - 1 , which are binary Hadamard codes (not necessarily linear) obtained as the Gray map image of quaternary linear codes of type $$2^\gamma 4^\delta $$ 2 γ 4 δ . Specifically, s-PD-sets of minimum size $$s+1$$ s + 1 for $$H_{\gamma , \delta }$$ H γ , δ , for all $$\delta \ge 3$$ δ ≥ 3 and $$2\le s \le \lfloor {\frac{2^{2\delta -2}}{\delta }}\rfloor -1$$ 2 ≤ s ≤ ⌊ 2 2 δ - 2 δ ⌋ - 1 , are constructed and recursive constructions are described. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Designs, Codes and Cryptography Springer Journals

Partial permutation decoding for binary linear and $$Z_4$$ Z 4 -linear Hadamard codes

Loading next page...
 
/lp/springer_journal/partial-permutation-decoding-for-binary-linear-and-z-4-z-4-linear-JNgulHjGB9
Publisher
Springer US
Copyright
Copyright © 2017 by Springer Science+Business Media New York
Subject
Mathematics; Combinatorics; Coding and Information Theory; Data Structures, Cryptology and Information Theory; Data Encryption; Discrete Mathematics in Computer Science; Information and Communication, Circuits
ISSN
0925-1022
eISSN
1573-7586
D.O.I.
10.1007/s10623-017-0342-8
Publisher site
See Article on Publisher Site

Abstract

In this paper, s- $${\text {PD}}$$ PD -sets of minimum size $$s+1$$ s + 1 for partial permutation decoding for the binary linear Hadamard code $$H_m$$ H m of length $$2^m$$ 2 m , for all $$m\ge 4$$ m ≥ 4 and $$2 \le s \le \lfloor {\frac{2^m}{1+m}}\rfloor -1$$ 2 ≤ s ≤ ⌊ 2 m 1 + m ⌋ - 1 , are constructed. Moreover, recursive constructions to obtain s- $${\text {PD}}$$ PD -sets of size $$l\ge s+1$$ l ≥ s + 1 for $$H_{m+1}$$ H m + 1 of length $$2^{m+1}$$ 2 m + 1 , from an s- $${\text {PD}}$$ PD -set of the same size for $$H_m$$ H m , are also described. These results are generalized to find s- $${\text {PD}}$$ PD -sets for the $${\mathbb {Z}}_4$$ Z 4 -linear Hadamard codes $$H_{\gamma , \delta }$$ H γ , δ of length $$2^m$$ 2 m , $$m=\gamma +2\delta -1$$ m = γ + 2 δ - 1 , which are binary Hadamard codes (not necessarily linear) obtained as the Gray map image of quaternary linear codes of type $$2^\gamma 4^\delta $$ 2 γ 4 δ . Specifically, s-PD-sets of minimum size $$s+1$$ s + 1 for $$H_{\gamma , \delta }$$ H γ , δ , for all $$\delta \ge 3$$ δ ≥ 3 and $$2\le s \le \lfloor {\frac{2^{2\delta -2}}{\delta }}\rfloor -1$$ 2 ≤ s ≤ ⌊ 2 2 δ - 2 δ ⌋ - 1 , are constructed and recursive constructions are described.

Journal

Designs, Codes and CryptographySpringer Journals

Published: Feb 20, 2017

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve Freelancer

DeepDyve Pro

Price
FREE
$49/month

$360/year
Save searches from Google Scholar, PubMed
Create lists to organize your research
Export lists, citations
Access to DeepDyve database
Abstract access only
Unlimited access to over
18 million full-text articles
Print
20 pages/month
PDF Discount
20% off