This study investigates the multiple attribute decision making under triangular fuzzy environment in which the attributes and experts are in different priority level. By combining the idea of quasi arithmetic mean and prioritized weighted average (PWA) operator, we first propose two new prioritized aggregation operators called quasi fuzzy prioritized weighted average (QFPWA) operator and the quasi fuzzy prioritized weighted ordered weighted average (QFPWOWA) operator for aggregating triangular fuzzy information. The properties of the new aggregation operators are studied in detail and their special cases are examined. Furthermore, based on the QFPWA operator and QFPWOWA operator, an approach to deal with multiple attribute decision-making problems under triangular fuzzy environments is developed. Finally, a practical example is provided to illustrate the multiple attribute decision making process.

The prioritized weighted average (PWA) operator was originally introduced by Yager. The prominent characteristic of the PWA operator is that it takes into account prioritization among attributes and decision makers. By combining the idea of generalized mean and PWA operator, we propose a new prioritized aggregation operator called fuzzy generalized prioritized weighted average (FGPWA) operator for aggregating triangular fuzzy numbers. The properties of the new aggregation operator are studied out and their special cases are examined. Furthermore, based on the FGPWA operator, an approach to deal with multiple attribute group decision making problems under triangular fuzzy environments is developed. Finally, a practical example is provided to illustrate the multiple attribute group decision making process.

Codes of variable length that are capable of error correction are studied. A lower bound on the average length of such codes under the criterion of promptness is obtained. This generalizes the celebrated result due to C.E. Shannon (1948) for the noiseless case. The bound obtained provides a measure of optimality for variable-length, error-correcting codes.>

The study of burst-error-correcting codes has generally been made without weight considerations while the random-error-correcting capabilities of a linear code largely depend upon the minimum weight. In this correspondence we have obtained extensions of the Varshamov-Gilbert and sphere-packing hounds to burst-error-correcting codes.