Special Classes of Set Codes and Their Applications

WB Vasantha Kandasamy; Florentin Smarandache

Home/Archive/arXiv

arXiv · 0812.5075

Special Classes of Set Codes and Their Applications

WB Vasantha Kandasamy·Florentin Smarandache

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this book, the authors introduce the notion of set codes, set bicodes and set n-codes. These are the most generalized notions of semigroup n-codes and group n-codes. Several types of set n-codes are defined. Several examples are given to enable the reader to understand the concept. These new classes of codes will find applications in cryptography, computer networking (where fragmenting of codes is to be carried out) and data storage (where confidentiality is to be maintained). We also describe the error detection and error correction of these codes. The authors feel that these codes would be appropriate to the computer dominated world. This book has three chapters. Chapter One gives basic concepts to make the book a self-contained one. In Chapter Two, the notion of set codes is introduced. The set bicodes and their generalization to set n-codes (n >= 3) is carried out in Chapter Three. This chapter also gives the applications of these codes in the above-mentioned fields.

Explore related subjects

math.GM

Keep this discovery

BibTeX RIS

WB Vasantha Kandasamy, Florentin Smarandache. 2008-12-30. Special Classes of Set Codes and Their Applications. https://arxiv.org/abs/0812.5075

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗

arXiv2026

The decrease in sectional curvature of the Fisher--Rao manifold of beta distributions

In the paper, the author develops a general convexity lemma and applies it to demonstrate the monotonic decrease of a function involving polygamma functions, arising from the sectional curvature of the Fisher--Rao manifold of beta distributions.

math.GM↗

arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗