| 1. |
- Bouyukliev, I. G., et al.
(författare)
-
Results on Binary Linear Codes With Minimum Distance 8 and 10
- 2011
-
Ingår i: IEEE Transactions on Information Theory. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9448 .- 1557-9654. ; 57:9, s. 6089-6093
-
Tidskriftsartikel (refereegranskat)abstract
- All linear binary codes with minimum distance 8 and codimension up to 14 and all codes with minimum distance 10 and codimension up to 18 are classified. Nonexistence of codes with parameters [33, 18, 8] and [33, 14, 10] is proved. This leads to 8 new exact bounds for binary linear codes. Primarily two algorithms considering the dual codes are used, namely extension of dual codes with a proper coordinate, and a fast algorithm for finding a maximum clique in a graph, which is modified to find a maximum set of vectors with the right dependency structure.
|
|
| 2. |
- Li, X. Y., et al.
(författare)
-
Coverage Properties of the Target Area in Wireless Sensor Networks
- 2012
-
Ingår i: Ieee Transactions on Information Theory. - 0018-9448 .- 1557-9654. ; 58:1, s. 430-437
-
Tidskriftsartikel (refereegranskat)abstract
- An analytical approximation is developed for the probability of sensing coverage in a wireless sensor network with randomly deployed sensor nodes each having an isotropic sensing area. This approximate probability is obtained by considering the properties of the geometric graph, in which an edge exists between any two vertices representing sensor nodes with overlapping sensing areas. The principal result is an approximation to the proportion of the sensing area that is covered by at least one sensing node, given the expected number of nodes per unit area in a two-dimensional Poisson process. The probability of a specified region being completely covered is also approximated. Simulation results corroborate the probabilistic analysis with low error, for any node density. The relationship between this approximation and noncoverage by the sensors is also examined. These results will have applications in planning and design tools for wireless sensor networks, and studies of coverage employing computational geometry.
|
|
