9,033 research outputs found
A Class of Quantum LDPC Codes Constructed From Finite Geometries
Low-density parity check (LDPC) codes are a significant class of classical
codes with many applications. Several good LDPC codes have been constructed
using random, algebraic, and finite geometries approaches, with containing
cycles of length at least six in their Tanner graphs. However, it is impossible
to design a self-orthogonal parity check matrix of an LDPC code without
introducing cycles of length four.
In this paper, a new class of quantum LDPC codes based on lines and points of
finite geometries is constructed. The parity check matrices of these codes are
adapted to be self-orthogonal with containing only one cycle of length four.
Also, the column and row weights, and bounds on the minimum distance of these
codes are given. As a consequence, the encoding and decoding algorithms of
these codes as well as their performance over various quantum depolarizing
channels will be investigated.Comment: 5pages, 2 figure
Secure Hop-by-Hop Aggregation of End-to-End Concealed Data in Wireless Sensor Networks
In-network data aggregation is an essential technique in mission critical
wireless sensor networks (WSNs) for achieving effective transmission and hence
better power conservation. Common security protocols for aggregated WSNs are
either hop-by-hop or end-to-end, each of which has its own encryption schemes
considering different security primitives. End-to-end encrypted data
aggregation protocols introduce maximum data secrecy with in-efficient data
aggregation and more vulnerability to active attacks, while hop-by-hop data
aggregation protocols introduce maximum data integrity with efficient data
aggregation and more vulnerability to passive attacks.
In this paper, we propose a secure aggregation protocol for aggregated WSNs
deployed in hostile environments in which dual attack modes are present. Our
proposed protocol is a blend of flexible data aggregation as in hop-by-hop
protocols and optimal data confidentiality as in end-to-end protocols. Our
protocol introduces an efficient O(1) heuristic for checking data integrity
along with cost-effective heuristic-based divide and conquer attestation
process which is in average -O(n) in the worst scenario- for
further verification of aggregated results
- …